零钱兑换
公式
dp[i] = Math.min(dp[i], dp[i - coin] + 1)
代码
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
| class Solution {
public:
int dp(vector<int>& d, vector<int>& coins,int n)
{
if (d[n] != -2)
{
return d[n];
}
else
{
d[n] = -1;
}
int i = 0;
int j = 0;
for (i = coins.size() - 1; i >= 0; i--)
{
j = n - coins[i];
if (j >= 0)
{
int dpj = dp(d,coins,j);
if (dpj != -1)
{
if (d[n] == -1)
{
d[n] = dpj + 1;
}
else if (d[n] > dpj + 1)
{
d[n] = dpj + 1;
}
}
}
}
return d[n];
}
int coinChange(vector<int>& coins, int amount) {
vector<int> d(amount + 1);
d[0] = 0;
for (int i = 1; i < amount + 1; i++)
{
d[i] = -2;
}
return dp(d,coins,amount);
}
};
|