-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMaxIceCream.java
More file actions
59 lines (53 loc) · 1.64 KB
/
MaxIceCream.java
File metadata and controls
59 lines (53 loc) · 1.64 KB
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
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
public class MaxIceCream {
static int dp[][];
static Map<String, Integer> mp;
public static int itemCnt(int a[], int n, int c) {
if(n==a.length || c==0) return 0;
else if(a[n] <= c) return Math.max(1+itemCnt(a,n+1,c-a[n]), itemCnt(a,n+1,c));
else return 0;
}
public static int itemCntRec(int a[], int n, int c) {
if(n==a.length+1 || c==0) return 0;
if(dp[n][c] != -1) {
//System.out.println(n + " " + c);
return dp[n][c];
}
else if(a[n-1] <= c) {
dp[n][c] = Math.max(1 + itemCntRec(a, n + 1, c - a[n-1]), itemCntRec(a, n + 1, c));
return dp[n][c];
}
else {
dp[n][c] = 0;
return 0;
}
}
public static int itemCntMap(int a[], int n, int c) {
String s = n+"_"+c;
if(n==a.length || c==0) return 0;
if(mp.containsKey(s)) {
return mp.get(s);
}
else if(a[n] <= c) {
mp.put(s, Math.max(1 + itemCntMap(a, n + 1, c - a[n]), itemCntMap(a, n + 1, c)));
return mp.get(s);
}
else {
mp.put(s,0);
return 0;
}
}
public static void main(String args[]) {
int a[] = {1,6,3,1,2,5};
int coin = 20;
Arrays.sort(a);
dp = new int[a.length+1][coin+1];
for(int aa[]: dp) Arrays.fill(aa,-1);
System.out.println(itemCnt(a,0,coin));
System.out.println(itemCntRec(a,1,coin));
mp = new HashMap<>();
System.out.println(itemCntMap(a,0,coin));
}
}