文章标题

11. Container With Most Water
Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container and n is at least 2.

class Solution {
public:
    int maxArea(vector<int>& height) {
        int Leng=height.size();
        int ans=-1;
        int lt=0,rt=Leng-1;
        while(lt!=rt)
        {
            int tmp=(rt-lt)*min(height[rt],height[lt]);
            if(ans<tmp)
                ans=tmp;
            if(height[rt]>height[lt])
                lt++;
            else
                rt--;
        }
        return ans;
    }
};

42. Trapping Rain Water

class Solution {
public:
    int trap(vector<int>& height) {
        int l=0, r=height.size()-1;
        int low=0;int level=0;
        int ans=0;
        while(l<r)
        {
            int low=height[height[l]<height[r]?l++:r--];
            level=max(low,level);
            ans+=level -low;
        }
        return ans;
    }
};

两题类似，均属数组题，由于设计两点所夹区域，用两指针从两头逼近。
需要注意在一侧指针递进时另一侧不必回归起点从头递归。
另外下题中某区域水容量只与两侧最高点达到水平有关，而与两侧最近点水平无关。