leetcode11.盛水最多的容器

 双指针问题，指向前后边界，每次只移动高度较小的那个

class Solution {
public:
    int maxArea(vector<int>& height) {
        int leftIndex=0,rightIndex=height.size()-1;
        int result=0;
        while(leftIndex<rightIndex){
            result=max(result,(rightIndex-leftIndex)*min(height[leftIndex],height[rightIndex]));
            height[leftIndex]<height[rightIndex]?leftIndex++:rightIndex--;
        }
        return result;
    }
};