首页 > 代码库 > 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.
public class Solution { /** * The algorithm is simple. We use two pointers to calculate the max area. * @param height -int array, * @return int -the max area * @author Averill Zheng * @version 2014-06-21 * @since JDK 1.7 */ public int maxArea(int[] height) { int max = 0; int start = 0, end = height.length - 1; while(start < end){ int temp = Math.min(height[start], height[end]) * (end - start); max = (max < temp) ? temp : max; if(height[start] <= height[end]) ++start; else --end; } return max; }}
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。