[leetcode] 799. Champagne Tower

Description

We stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row. Each glass holds one cup of champagne.

Then, some champagne is poured into the first glass at the top. When the topmost glass is full, any excess liquid poured will fall equally to the glass immediately to the left and right of it. When those glasses become full, any excess champagne will fall equally to the left and right of those glasses, and so on. (A glass at the bottom row has its excess champagne fall on the floor.)

For example, after one cup of champagne is poured, the top most glass is full. After two cups of champagne are poured, the two glasses on the second row are half full. After three cups of champagne are poured, those two cups become full - there are 3 full glasses total now. After four cups of champagne are poured, the third row has the middle glass half full, and the two outside glasses are a quarter full, as pictured below.

Now after pouring some non-negative integer cups of champagne, return how full the jth glass in the ith row is (both i and j are 0-indexed.)

Example 1:

Input: poured = 1, query_row = 1, query_glass = 1
Output: 0.00000
Explanation: We poured 1 cup of champange to the top glass of the tower (which is indexed as (0, 0)). There will be no excess liquid so all the glasses under the top glass will remain empty.

Example 2:

Input: poured = 2, query_row = 1, query_glass = 1
Output: 0.50000
Explanation: We poured 2 cups of champange to the top glass of the tower (which is indexed as (0, 0)). There is one cup of excess liquid. The glass indexed as (1, 0) and the glass indexed as (1, 1) will share the excess liquid equally, and each will get half cup of champange.

Example 3:

Input: poured = 100000009, query_row = 33, query_glass = 17
Output: 1.00000

Constraints:

• 0 <= poured <= 109
• 0 <= query_glass <= query_row < 100

分析

题目的意思是：给定一个香槟塔，往香槟塔倒香槟，问第query_row行的query_glass的被子的水是多少。这道题我看了一下别人的实现，首先是要定义一个dp数组,dp[i][j]表示第i层第j个杯子的水量，dp[i][j]和dp[i-1][j],dp[i-1][j+1]有关，为了避免下标的越界，可以转换为dp[i][j]的水量会影响到dp[i+1][j],dp[i+1][j+1]，然后递推公式就为：

dp[i+1][j+1]+=(dp[i][j]-1)/2
dp[i+1][j]+=(dp[i][j]-1)/2

最后的输出就是dp[query_row][query_glass],因为题目给出的是从0开始的啦，所以就不用变换坐标了。还有一种情况dp[query_row][query_glass]填满以后，pored还有剩余的，会传递给其下面的杯子，所以dp[query_row][query_glass]不能超过1.

代码

class Solution:
    def champagneTower(self, poured: int, query_row: int, query_glass: int) -> float:
        dp=[[0]*101 for i in range(101)]
        dp[0][0]=poured
        for i in range(query_row+1):
            for j in range(i+1):
                if(dp[i][j]>1):
                    dp[i+1][j+1]+=(dp[i][j]-1)/2
                    dp[i+1][j]+=(dp[i][j]-1)/2
        return min(1,dp[query_row][query_glass])

参考文献

[LeetCode] Champagne Tower 香槟塔