LeetCode – Refresh – Trapping Rain Water

Scanning from left to right and right to left.

Find the max height of left and right. The minimum one will be most possible height for current state that can bound the water. But one thing need to check:

whether current height is higher than the value.

class Solution {
public:
    int trap(int A[], int n) {
        if (n < 3) return 0;
        vector<int> left(n), right(n);
        int result = 0, rec = A[0];
        for (int i = 1; i < n; i++) {
            left[i] = max(rec, left[i-1]);
            rec = max(rec, A[i]);
        }
        rec = A[n-1];
        for (int i = n-2; i >= 0; i--) {
            right[i] = max(rec, right[i+1]);
            rec = max(rec, A[i]);
        }
        for (int i = 0; i < n; i++) {
            result += (min(left[i], right[i]) - A[i]) > 0 ? (min(left[i], right[i]) - A[i]) : 0;
        }
        return result;
    }
};