zoukankan      html  css  js  c++  java
  • 0799. Champagne Tower (M)

    Champagne Tower (M)

    题目

    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 (250ml) of champagne.

    Then, some champagne is poured in 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.

    img

    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 <= 10^9
    • 0 <= query_glass <= query_row < 100

    题意

    将酒杯摆成金字塔状,往最顶层的杯子倒酒,多余的酒会溢出到下一层的杯子中。求倒入一定量酒后,指定杯子中酒的数量。

    思路

    直接从上到下模拟每一层的变化。


    代码实现

    Java

    class Solution {
        public double champagneTower(int poured, int query_row, int query_glass) {
            double[][] glasses = new double[101][101];
            glasses[0][0] = 1.0 * poured;
            for (int i = 0; i <= query_row; i++) {
                for (int j = 0; j <= i; j++) {
                    if (glasses[i][j] > 1.0) {
                        double overflow = glasses[i][j] - 1.0;
                        glasses[i][j] = 1.0;
                        glasses[i + 1][j] += overflow / 2;
                        glasses[i + 1][j + 1] += overflow / 2;
                    }
                }
            }
            return glasses[query_row][query_glass];
        }
    }
    
  • 相关阅读:
    关于FileUpload控件的二种用法,你都懂吗?
    Application全局对象 实现统计当前在线人数和总访问次数
    使用COOKIE对像实现保存用户基本信息(结合Session),ASP.Net实现用户登录全过程
    递规篇历路径之 使用正则过滤( 将符合正则的名称用另种正则格式替换掉 )某个路径下的所有文件或文件夹的完整路径
    小偷程序之网页分块筛选
    c#中的socket编程基础
    ASP.Net中的一些基础家常事
    PHP数组
    Effective C++总结
    构造函数、析构函数、虚函数可否内联,有何意义
  • 原文地址:https://www.cnblogs.com/mapoos/p/13883017.html
Copyright © 2011-2022 走看看