LintCode_362 Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

Trapping Rain Water

Example

Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6.

Challenge 

O(n) time and O(1) memory

O(n) time and O(n) memory is also acceptable.

先找出最高点, 然后分别计算left的和与right的和,因为在最高点两边, 所以互不影响。


class Solution {
public:
    /**
     * @param heights: a vector of integers
     * @return: a integer
     */
    int trapRainWater(vector<int> &heights) {
        // write your code here
        if (heights.size() <= 2)
            return 0;
        heights.push_back(0);
        heights.insert(heights.begin(), 0);
        int max_h = 0;
        int ind;
        int sum_left = 0;
        int bar_left = 0;
        int sum_right = 0;
        int bar_right = 0;
        
        for (int i = 0; i < heights.size(); i++) {
            if (heights[i] > max_h) {
                max_h = heights[i];
                ind = i;
            }
        }
        for (int i = 0; i < ind; i++) {
            if (heights[i] > bar_left) {
                bar_left = heights[i];
            } else {
                sum_left+=(bar_left - heights[i]);
            }
        }
        for (int i = heights.size() - 1; i > ind; i--) {
            if (heights[i] > bar_right) {
                bar_right = heights[i];
            } else {
                sum_right+=(bar_right - heights[i]);
            }
        }
        return sum_left + sum_right;
    }
};






  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值