Leetcode Problem 799. Champagne Tower

799. Champagne Tower

Leetcode Solutions

Initialize a 2D array dp to represent the glasses, with a size sufficient to cover all rows (100 rows in this case).
Set dp[0][0] to poured as all champagne starts at the top glass.
Iterate through the rows of the pyramid from the top to the bottom.
For each glass in the current row, calculate the flow-through amount Q that will go to the glasses in the next row if the current glass's flow-through is more than 1 cup.
Distribute the excess flow-through equally to the two glasses below the current glass.
After simulating all rows, the amount of champagne in the query_glass of the query_row is the minimum of 1 cup and the value in dp[query_row][query_glass].

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen