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.
思路分析
类似于二分查找的策略
从两头开始逐渐向中间靠拢
代码
java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
publicclassSolution011{
publicintmaxArea(int[] height){
if (height == null || height.length < 2)
return0;
int max = 0;
int left = 0;
int right = height.length - 1;
while (left < right) {
int tmp = (right - left) * Math.min(height[left], height[right]);