码迷,mamicode.com
首页 > 其他好文 > 详细

Container With Most Water 解答

时间:2015-09-17 06:25:06      阅读:120      评论:0      收藏:0      [点我收藏+]

标签:

Question

Given n non-negative integers a1a2, ..., an, where each represents a point at coordinate (iai). n vertical lines are drawn such that the two endpoints of line i is at (iai) 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.

Solution

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 }

 

Container With Most Water 解答

标签:

原文地址:http://www.cnblogs.com/ireneyanglan/p/4815098.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!