首页 > 代码库 > Container With Most Water
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 linei 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.
答案
public class Solution { public int maxArea(int[] height) { if(height==null||height.length<2) { return 0; } int N=height.length; int []left=new int[N]; int []right=new int[N]; int max=0; List<Integer> listLeft=new LinkedList<Integer>(); List<Integer> listRight=new LinkedList<Integer>(); left[0]=height[0]; right[N-1]=height[N-1]; listLeft.add(0); listRight.add(N-1); for(int i=1;i<N;i++) { if(height[i]>left[i-1]) { left[i]=height[i]; listLeft.add(i); } else { left[i]=left[i-1]; } } for(int i=N-2;i>=0;i--) { if(height[i]>right[i+1]) { right[i]=height[i]; listRight.add(i); } else { right[i]=right[i+1]; } } for(Integer i:listLeft) { for(Integer j:listRight) { if(j<=i) { break; } max=Math.max(max,(j-i)*Math.min(height[i],height[j])); } } return max; } }
Container With Most Water
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。