forked from kant003/JavaPracticeHacktoberfest
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCoin Change.java
39 lines (29 loc) · 851 Bytes
/
Coin Change.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
import java.util.*;
class Change{
static long countWaysToMakeChange(int[] arr, int n, int T){
long[] prev=new long[T+1];
for(int i=0;i<=T;i++){
if(i%arr[0]==0)
prev[i]=1;
}
for(int ind=1; ind<n;ind++){
long cur[]=new long[T+1];
for(int target=0;target<=T;target++){
long notTaken = prev[target];
long taken = 0;
if(arr[ind]<=target)
taken = cur[target-arr[ind]];
cur[target] = notTaken + taken;
}
prev = cur;
}
return prev[T];
}
public static void main(String args[]) {
int arr[] ={1,2,3};
int target=4;
int n =arr.length;
System.out.println("The total number of ways is "+countWaysToMakeChange
(arr,n,target));
}
}