class Solution {
public double champagneTower(int poured, int query_row, int query_glass) {
double[][] arr = new double[101][101];
// 当前的值确定了的话,下一层左右两边的值就确认了
arr[0][0] = poured;
for(int i = 0; i <= query_row; i++) { // 行
for(int j = 0; j <= i; j++ ) { // 列
double num = (arr[i][j]-1.0)/2;
if(num > 0) {
arr[i+1][j] += num;
arr[i+1][j+1] += num;
}
}
}
return Math.min(1, arr[query_row][query_glass]);
}
}