42. Trapping Rain Water

最新推荐文章于 2022-01-25 23:54:30 发布

MachineChen

最新推荐文章于 2022-01-25 23:54:30 发布

阅读量170

点赞数

分类专栏： LeetCode 文章标签： leetcode trapping rain-water

本文链接：https://blog.csdn.net/u012611878/article/details/78509066

版权

LeetCode 专栏收录该内容

29 篇文章 1 订阅

订阅专栏

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.

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

这里写图片描述

The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped.

#include "TrappingRainWater.h"

int TrappingRainWater::trap(vector<int>& height)
{
    //從兩邊逼近中間
    int left = 0; int right = height.size() - 1;
    int res = 0;
    int maxleft = 0, maxright = 0;
    while (left <= right) {
        //木桶定律，以小的做標準
        if (height[left] <= height[right]) {
            if (height[left] >= maxleft) maxleft = height[left];
            else res += maxleft - height[left];
            left++;
        }
        else {
            if (height[right] >= maxright) maxright = height[right];
            else res += maxright - height[right];
            right--;
        }
    }
    return res;
}