Leetcode 815 Solution

This article provides solution to leetcode question 815 (champagne-tower)
Categories:
Tags:
Access this page by simply typing in "lcs 815" in your browser address bar if you have bunnylol configured.

https://leetcode.com/problems/champagne-tower

Solution

class Solution:
    def champagneTower(self, poured: int, query_row: int, query_glass: int) -> float:
        i = 0



        dp = [[0 for _ in range(101)] for _ in range(101)]
        dp[0][0] = poured



        for i in range(100):
            for j in range(i + 1):
                if dp[i][j] > 1:
                    overflow = dp[i][j] - 1
                    dp[i][j] = 1
                    dp[i + 1][j] += overflow / 2
                    dp[i + 1][j + 1] += overflow / 2



        return dp[query_row][query_glass]