LeetCode11. Container With Most Water[C++]

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). nvertical 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.

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

解题思路：

left+right指针，遍历整个数组。取最大area。left，right谁小移动谁。

class Solution {
public:
    int maxArea(vector<int>& height) {
        int left=0,right=height.size()-1,area=0;
        while(left<right)
        {
            int area2=(height[left]<height[right]?height[left]:height[right])*(right-left);
            area=area>area2?area:area2;
            if(height[left]<height[right])
                left++;
            else
                right--;
        }
        return area;
    }
};