LeetCode 011 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) {
        
        int start = 0;
        int end = height.size() - 1;
        int result = INT_MIN;
        
        while(start < end){
            
            //从两边开始，每次计算面积
            int area = min(height[end], height[start]) * (end - start);
            result = max(area, result);
            
            //加逼定理
            if(height[start] < height[end]) 
                start++;
            else 
                end--;
        }
        return result;
        
    }
};

 Java:

    public int maxArea(int[] height) {

        int start = 0;
        int end = height.length - 1;
        int result = Integer.MIN_VALUE;

        while (start < end) {
            
            int area = Math.min(height[start], height[end]) * (end - start);
            result = Math.max(result, area);

            if (height[start] > height[end]) {
                end--;
            } else {
                start++;
            }
        }
        
        return result;
    }