Container With Most Water

来源:互联网 发布:php 房源管理系统 编辑:程序博客网 时间:2024/06/06 18:48

题目

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.

解题思路

面积只看边界的两条线,和中间的线没关系。两个指针i,j分别指向头和尾,如果头小,i++,否则j++。

代码

public class Solution {  public int maxArea(int[] height){int i=0;int j=height.length-1;int max=0;while(j>i){int tmp=height[i]<=height[j]?height[i]:height[j];if(tmp*(j-i)>max)max=tmp*(j-i);if(height[i]<=height[j])++i;else--j;}return max;}}


运行结果




0 0
原创粉丝点击