题目描述:
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 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
-
代码:
class Solution {
public int maxArea(int[] height) {
int left=0;
int right=height.length-1;
int maxArea=0;
while(left<right){
int curArea=(right-left)*Math.min(height[left],height[right]);
if(curArea>maxArea){
maxArea=curArea;
}
if(height[right]>height[left]){
left++;
}else{
right--;
}
}
return maxArea;
}
}
解题思路:
题目是求两点在坐标轴上围成的矩形面积的最大值,暴力解法是求出所有点围成的最大值,时间复杂度为O(n2)。
观察题目可以发现,要得到更大的面积:
- 两点之间距离尽可能远
- 两点的高度的较小值需要尽可能的大
设置两个指针从最左和最右出发,要想寻找更大的面积,那么可以采取:当右边高度大于左边,移动左指针,使左边高度尽可能变高 。当左边高度大于右边,移动右指针,使右边高度尽可能变高 。这个过程是贪心算法的过程,每一步操作都是寻找当前可能产生的最大面积(局部最优解),左右指针不断靠近,记录寻找到的最大面积。