Leetcode 42. Trapping Rain Water (Hard) (cpp)

Leetcode 42. Trapping Rain Water (Hard) (cpp)

Tag: Array, Stack, Two Pointers

Difficulty: Hard

/*

42. Trapping Rain Water (Hard)

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. Thanks Marcos for contributing this image!

*/
class Solution {
public:
    int trap(vector<int>& height) {
        if (height.size() < 3) {
            return 0;
        }
        int res = 0, i = 0, j = height.size() - 1;
        while (i < j - 1) {
            int bar = min(height[i], height[j]);
            for (int k = i + 1; k < j; k++) {
                if (height[k] < bar) {
                    res += bar - height[k];
                    height[k] = bar;
                }
            }
            while (height[i] == bar) {
                i++;
            }
            while (height[j] == bar) {
                j--;
            }
        }
        return res;
    }
};