Leetcode 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.

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(int A[], int n) {
        if(A == NULL)
            return 0;
        int max_idx = 0;
        for(int i = 1; i < n; ++i)
        {
            if(A[i] > A[max_idx])
                max_idx = i;
        }
        
        int res = 0;
        int max_left = A[0];
        //scan from left to max_idx
        for(int i = 1; i <= max_idx; ++i)
        {
            if(A[i] > max_left)
                max_left = A[i];
            else 
                res += max_left - A[i];
        }
        max_left = A[n - 1];
        //scan from right th max_idx
        for(int i = n - 2; i >= max_idx; --i)
        {
            if(A[i] > max_left)
                max_left = A[i];
            else 
                res += max_left - A[i];
        }
        return res;
    }
};