0799-champagne-tower.js

/**
 * 799. Champagne Tower
 * https://leetcode.com/problems/champagne-tower/
 * Difficulty: Medium
 *
 * 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.
 */

/**
 * @param {number} poured
 * @param {number} queryRow
 * @param {number} queryGlass
 * @return {number}
 */
var champagneTower = function(poured, queryRow, queryGlass) {
  const tower = new Array(101).fill().map(() => new Array(101).fill(0));
  tower[0][0] = poured;

  for (let row = 0; row <= queryRow; row++) {
    for (let glass = 0; glass <= row; glass++) {
      const excess = (tower[row][glass] - 1) / 2;

      if (excess > 0) {
        tower[row + 1][glass] += excess;
        tower[row + 1][glass + 1] += excess;
      }
    }
  }

  return Math.min(1, tower[queryRow][queryGlass]);
};