首页 > 代码库 > 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 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.
方法
选出两条线,使其面积最大。遍历一遍即可。public int maxArea(int[] height) { if (height == null || height.length == 0 || height.length == 1) { return 0; } int len = height.length; int left = 0; int right = len - 1; int area = 0; while (left < right) { int temp = Math.min(height[left], height[right]) * (right - left); if (temp > area) { area = temp; } if (height[left] < height[right]) { left++; } else { right--; } } return area; }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。