上次编辑到这里，代码来自缓存 点击恢复默认模板
class Solution {
public:
double champagneTower(int poured, int query_row, int query_glass) {
}
};
golang 解法, 执行用时: 0 ms, 内存消耗: 4.7 MB, 提交时间: 2022-11-20 10:10:11
func champagneTower(poured, queryRow, queryGlass int) float64 {
row := []float64{float64(poured)}
for i := 1; i <= queryRow; i++ {
nextRow := make([]float64, i+1)
for j, volume := range row {
if volume > 1 {
nextRow[j] += (volume - 1) / 2
nextRow[j+1] += (volume - 1) / 2
}
}
row = nextRow
}
return math.Min(1, row[queryGlass])
}
golang 解法, 执行用时: 0 ms, 内存消耗: 2 MB, 提交时间: 2022-11-20 10:09:56
func champagneTower(poured int, query_row int, query_glass int) float64 {
f := [101][101]float64{}
f[0][0] = float64(poured)
for i := 0; i <= query_row; i++ {
for j := 0; j <= i; j++ {
if f[i][j] > 1 {
half := (f[i][j] - 1) / 2.0
f[i][j] = 1
f[i+1][j] += half
f[i+1][j+1] += half
}
}
}
return f[query_row][query_glass]
}
python3 解法, 执行用时: 92 ms, 内存消耗: 15.1 MB, 提交时间: 2022-11-20 10:09:17
class Solution:
def champagneTower(self, poured: int, query_row: int, query_glass: int) -> float:
f = [[0] * 101 for _ in range(101)]
f[0][0] = poured
for i in range(query_row + 1):
for j in range(i + 1):
if f[i][j] > 1:
half = (f[i][j] - 1) / 2
f[i][j] = 1
f[i + 1][j] += half
f[i + 1][j + 1] += half
return f[query_row][query_glass]
python3 解法, 执行用时: 68 ms, 内存消耗: 14.9 MB, 提交时间: 2022-11-20 10:08:43
class Solution:
def champagneTower(self, poured: int, query_row: int, query_glass: int) -> float:
row = [poured]
for i in range(1, query_row + 1):
nextRow = [0] * (i + 1)
for j, volume in enumerate(row):
if volume > 1:
nextRow[j] += (volume - 1) / 2
nextRow[j + 1] += (volume - 1) / 2
row = nextRow
return min(1, row[query_glass])
