-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
799.java
48 lines (44 loc) · 1.77 KB
/
799.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
__________________________________________________________________________________________________
sample 1 ms submission
class Solution {
public double champagneTower(int poured, int query_row, int query_glass) {
double[] flow = new double[query_row + 1];
flow[0] = poured;
if (query_row == 0) {
return flow[0] >= 1 ? 1 : 0;
}
for (int i = 1; i <= query_row; i++) {
for (int j = i; j >= 0; j--) {
if (j == 0) {
flow[j] = (flow[j] - 1 >= 0 ? flow[j] - 1 : 0) / 2.0;
}
else if (j == i) {
flow[j] = (flow[j - 1] - 1 >= 0 ? flow[j - 1] - 1 : 0) / 2.0;
}
else {
flow[j] = ((flow[j] - 1 >= 0 ? flow[j] - 1 : 0) + (flow[j - 1] - 1 >= 0 ? flow[j - 1] - 1 : 0)) / 2.0;
}
if (i == query_row && j == query_glass) {
return flow[j] >= 1 ? 1 : flow[j];
}
}
}
return 0;
}
}
__________________________________________________________________________________________________
sample 32340 kb submission
class Solution {
public double champagneTower(int poured, int row, int glass) {
double[] current = new double[row + 1];
current[0] = poured;
for (int i = 1; i <= row; i++) {
for (int j = i; j > 0; j--) {
current[j] = (Math.max(current[j - 1] - 1, 0) + Math.max(current[j] - 1, 0)) / 2.0;
}
current[0] = Math.max(current[0] - 1, 0) / 2.0;
}
return Math.min(current[glass], 1);
}
}
__________________________________________________________________________________________________