Skip to content

Commit 272f3cb

Browse files
authored
fix: remove useless comments
1 parent a8ceadb commit 272f3cb

File tree

1 file changed

+0
-41
lines changed

1 file changed

+0
-41
lines changed

problems/322.coin-change.md

Lines changed: 0 additions & 41 deletions
Original file line numberDiff line numberDiff line change
@@ -77,47 +77,6 @@ eg: 对于 [1,2,5] 组成 11 块
7777

7878
JavaScript Code:
7979
```js
80-
/*
81-
* @lc app=leetcode id=322 lang=javascript
82-
*
83-
* [322] Coin Change
84-
*
85-
* https://leetcode.com/problems/coin-change/description/
86-
*
87-
* algorithms
88-
* Medium (29.25%)
89-
* Total Accepted: 175K
90-
* Total Submissions: 591.9K
91-
* Testcase Example: '[1,2,5]\n11'
92-
*
93-
* You are given coins of different denominations and a total amount of money
94-
* amount. Write a function to compute the fewest number of coins that you need
95-
* to make up that amount. If that amount of money cannot be made up by any
96-
* combination of the coins, return -1.
97-
*
98-
* Example 1:
99-
*
100-
*
101-
* Input: coins = [1, 2, 5], amount = 11
102-
* Output: 3
103-
* Explanation: 11 = 5 + 5 + 1
104-
*
105-
* Example 2:
106-
*
107-
*
108-
* Input: coins = [2], amount = 3
109-
* Output: -1
110-
*
111-
*
112-
* Note:
113-
* You may assume that you have an infinite number of each kind of coin.
114-
*
115-
*/
116-
/**
117-
* @param {number[]} coins
118-
* @param {number} amount
119-
* @return {number}
120-
*/
12180

12281
var coinChange = function(coins, amount) {
12382
if (amount === 0) {

0 commit comments

Comments
 (0)