标签：
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.
Since the area size is largely depended on shorter height, so we use two pointers. Time complexity O(n), space cost O(1).
1 public class Solution { 2 public int maxArea(int[] height) { 3 if (height == null || height.length < 2) 4 return 0; 5 int left = 0, right = height.length - 1; 6 int result = 0, tmp = 0; 7 while (left < right) { 8 tmp = (right - left) * Math.min(height[left], height[right]); 9 result = Math.max(result, tmp); 10 if (height[left] <= height[right]) 11 left++; 12 else 13 right--; 14 } 15 return result; 16 } 17 }
标签：
原文地址：http://www.cnblogs.com/ireneyanglan/p/4815098.html
