-
Notifications
You must be signed in to change notification settings - Fork 0
/
079_FindMinimumNumberOfCoins.cpp
63 lines (53 loc) · 1.22 KB
/
079_FindMinimumNumberOfCoins.cpp
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include <bits/stdc++.h>
using namespace std;
int findMinimumCoins(int amount)
{
// Write your code here
vector<int> nums = {1, 2, 5, 10, 20, 50, 100, 500, 1000};
int n = nums.size();
int minCoins = 0;
for (int i = n - 1; i >= 0; i--)
{
if (amount / nums[i] >= 1)
{
minCoins += amount / nums[i];
amount %= nums[i];
}
if (amount == 0)
break;
}
return minCoins;
// Method-2
vector<vector<int>> memo(n + 1, vector<int>(amount + 1, INT_MAX - 1));
for (int i = 0; i <= n; i++)
{
memo[i][0] = 0;
}
for (int j = 0; j <= amount; j++)
{
memo[0][j] = INT_MAX - 1;
}
for (int j = 1; j <= amount; j++)
{
int sum = j % nums[0];
if (sum == 0)
{
memo[1][j] = j / nums[0];
}
}
for (int i = 2; i <= n; i++)
{
for (int j = 1; j <= amount; j++)
{
if (nums[i - 1] <= j)
{
memo[i][j] = min(memo[i - 1][j], 1 + memo[i][j - nums[i - 1]]);
}
else
{
memo[i][j] = memo[i - 1][j];
}
}
}
return memo[n][amount];
}