Container With Most Water

最新推荐文章于 2024-08-28 08:50:09 发布

weixin_30621711

最新推荐文章于 2024-08-28 08:50:09 发布

阅读量46

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/mrpod2g/p/4385857.html

本文解析了一道经典的算法题目：给定一系列高度不一的垂直线，找出两条线构成的容器能盛最多水的解决方案。采用双指针法逐步逼近最优解，通过对比两端高度确定移动方向。

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 {
    public int maxArea(int[] height) {
        int i = 0;
        int j = height.length-1;
        int max = 0;
        while(i<j) {
            int volum = (height[i]<height[j]? height[i]:height[j])*(j-i);
            max = volum>max?volum:max;
            if(height[i]>height[j]) j--;
            else i++;
        }
        return max;
    }
}