Leetcode Trapping Rain Water

水的高度又左右两边高度最大值的较小值决定，从左到右扫描一次，从右到左扫描一次

    int trap(int A[], int n) {
        vector<int> left(n,0);
        vector<int> right(n,0);
        int i, maxx = 0;
        for(i = 0; i < n; i++)
            left[i] = maxx = max(maxx, A[i]);
        maxx = 0;
        for(i = n-1; i >= 0; i--)
            right[i] = maxx = max(maxx,A[i]);
        int ans = 0;
        for(i = 0; i < n; i++){
            ans += min(left[i], right[i]) - A[i];
        }
        return ans;
    }