LeetCode 11. Container With Most Water(java)

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 and n is at least 2.

思路:由于只需要确定两个竖线的位置,求两个竖线之间的容量,因此,用双指针的想法,两端向中间逼近,每次逼近的方法是,如果左边竖线更高,就end–,如果右边竖线更高,就begin++。

public int maxArea(int[] height) {
        if (height.length <= 1) return 0;
        int begin = 0, end = height.length - 1, max = 0;
        while (begin < end) {
            int area = Math.min(height[begin], height[end]) * (end - begin);
            if (area > max) max = area;
            if (height[begin] > height[end]) {
                end--;
            } else {
                begin++;
            }
        }
        return max;
    }
阅读更多
文章标签: java leetcode lines
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭