Leetcode Trapping Rain Water

一开始思路就错了。以为每次找到一个局部的最小值，然后向两边展开就可以了，后来WA了巨多次，发现make no sense。

然后换了另一种做法，先找出最高点，然后初始化局部最高点为头尾两个点，并由两边往最高点处遍历，每遇到一个比局部最高点大的数就停下来就算一次水的容量，并更新局部最高点。

class Solution {
public:
    int trap(int A[], int n) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int sum_area = 0, max_height = -1, max_height_index = -1;;
        for(int i = 0; i < n; i++){
            if(A[i] > max_height){
                max_height = A[i];
                max_height_index = i;
            }
        }
        int local_max = A[0], local_max_index = 0, block = 0;
        for(int i = 1; i <= max_height_index; i++){
            if(A[i] >= local_max){
                sum_area += local_max * (i-local_max_index-1)-block;
                block = 0;
                local_max = A[i];
                local_max_index = i;
            }
            else{
                block += A[i];
            }
        }
        local_max = A[n-1], local_max_index = n-1, block = 0;
        for(int i = n-2; i >= max_height_index; i--){
            if(A[i] >= local_max){
                sum_area += local_max * (local_max_index-i-1) - block;
                block = 0;
                local_max = A[i];
                local_max_index = i;
            }
            else{
                block += A[i];
            }
        }
        return sum_area;
    }
};