-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcoin.java
62 lines (61 loc) · 1017 Bytes
/
coin.java
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
import java.io.*;
import java.util.Scanner;
class coin
{
public static void main(String ar[])
{
int coins[] = {1,4,6};
int max = 8;
Solution obj = new Solution();
obj.coin_change(coins , max);
}
}
class Solution
{
void coin_change(int coins[], int max)
{
int arr[][] = new int[coins.length+1][max+1];
for(int i=0;i<=max;i++)
{
arr[0][i] = Integer.MAX_VALUE;
}
for(int i=0;i<=coins.length;i++)
{
arr[i][0] = 0;
}
for(int i=1;i<=coins.length;i++)
{
for(int j=1;j<=max;j++)
{
if(j < coins[i-1])
{
arr[i][j] = arr[i-1][j];
}
else
{
arr[i][j] = min(1+arr[i][j-coins[i-1]],arr[i-1][j]);
System.out.println("check min at : "+(1+arr[i][max-coins[i-1]])+","+arr[i-1][j]+"("+i+","+j+")");
}
}
}
for(int i=0;i<=coins.length;i++)
{
for(int j=0;j<=max;j++)
{
System.out.print(arr[i][j] + "\t");
}
System.out.println();
}
}
int min(int a , int b)
{
if(a<b)
{
return a;
}
else
{
return b;
}
}
}