[LeetCode]Container With Most Water

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.

求隔板间的面积最大。

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