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], return6.
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) 
    {
        int ans = 0;
        if(n == 0)
            return ans;

        int l = 0, r = n-1;
        while(l < r)
        {
            int t = min(A[l], A[r]);
            if(t == A[l])
            {
                ++l;
                while(l < r && A[l] < t)
                {
                    ans += t - A[l];
                    ++l;
                }
            }
            else
            {
                --r;
                while(l < r && A[r] < t)
                {
                    ans += t - A[r];
                    --r;
                }
            }
        }
        return ans;
    }
};