【Leetcode】Container With Most Water

标签：

题目链接：https://leetcode.com/problems/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.

思路：

左右向中间遍历，如果左边高度大于右边高度，则右边游标左移，因为此时只有左移才有机会大于当前最大面积。否则同理。

算法：

public int maxArea(int[] height) {  
    int maxArea = 0, start = 0, end = height.length - 1;  
    while (start < end) {  
        maxArea = Math.max(maxArea,  
                (end - start) * Math.min(height[start], height[end]));  
        if (height[start] > height[end]) {  
            end--;  
        } else {  
            start++;  
        }  
    }  
    return maxArea;  
}  

【Leetcode】Container With Most Water

标签：

原文地址：http://blog.csdn.net/yeqiuzs/article/details/51501287