2023.09.24 Today's Challenge

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

LeetCode - The World's Leading Online Programming Learning Platform

시뮬레이션 문제

class Solution:
    def champagneTower(self, poured: int, query_row: int, query_glass: int) -> float:
        a = [[0] * k for k in range(1, 102)]
        a[0][0] = poured

        for r in range(query_row + 1):
            for c in range(r + 1):
                q = (a[r][c] - 1.0) / 2.0
                if q > 0:
                    a[r+1][c] += q
                    a[r+1][c+1] += q
        
        return min(1, a[query_row][query_glass])