forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSoup Servings.java
68 lines (58 loc) · 2.04 KB
/
Soup Servings.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
63
64
65
66
67
68
class Solution {
public double soupServings(int n) {
//dp[i][j] = 0.25 * dp[i - 100][j] + 0.25 * dp[i - 75][j - 25]
// + 0.25 * dp[i - 50][j - 50] + 0.25 * dp[i - 75][j - 25]
if (n >= 4276){
return 1;
}
n = (n + 24) / 25;
double[][] dp = new double[n + 1][n + 1];
for (int i = 0; i <= n; i++){
for (int j = 0; j <= n; j++){
if (i == 0 && j == 0){
dp[i][j] = 0.5;
}else if (i == 0){
dp[i][j] = 1;
}else if (j == 0){
dp[i][j] = 0;
}else{
dp[i][j] += dp[max(i - 4)][j] * 0.25;
dp[i][j] += dp[max(i - 3)][max(j - 1)] * 0.25;
dp[i][j] += dp[max(i - 2)][max(j - 2)] * 0.25;
dp[i][j] += dp[max(i - 1)][max(j - 3)] * 0.25;
}
}
}
return dp[n][n];
}
private int max(int a){
return Math.max(a, 0);
}
}
//class Solution {
// public double soupServings(int n) {
// //dp[i][j] = 0.25 * dp[i - 100][j] + 0.25 * dp[i - 75][j - 25]
// // + 0.25 * dp[i - 50][j - 50] + 0.25 * dp[i - 75][j - 25]
// double[][] dp = new double[n + 1][n + 1];
// for (int i = 0; i <= n; i++){
// for (int j = 0; j <= n; j++){
// if (i == 0 && j == 0){
// dp[i][j] = 0.5;
// }else if (i == 0){
// dp[i][j] = 1;
// }else if (j == 0){
// dp[i][j] = 0;
// }else{
// dp[i][j] += dp[max(i - 100)][j] * 0.25;
// dp[i][j] += dp[max(i - 75)][max(j - 25)] * 0.25;
// dp[i][j] += dp[max(i - 50)][max(j - 50)] * 0.25;
// dp[i][j] += dp[max(i - 25)][max(j - 75)] * 0.25;
// }
// }
// }
// return dp[n][n];
// }
// private int max(int a){
// return Math.max(a, 0);
// }
//}