首页 > 代码库 > Leetcode-Container With Most Water
Leetcode-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.
Analysis:
Solution:
1 public class Solution { 2 public int maxArea(int[] height) { 3 int max = 0; 4 int head = 0; 5 int end = height.length-1; 6 7 while (head<end){ 8 int left = height[head]; 9 int right = height[end];10 int vol = (end-head)*Math.min(left,right);11 if (vol>max) max = vol;12 13 if (left<=right)14 while (head<end && left>=height[head]) head++;15 else 16 while (head< end && right>=height[end]) end--;17 }18 19 return max; 20 21 }22 }
Leetcode-Container With Most Water
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。