【Leetcode解题记录】11. Container With Most Water

最新推荐文章于 2022-02-20 18:08:08 发布

panzejia

最新推荐文章于 2022-02-20 18:08:08 发布

阅读量123

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/panzejia/article/details/79319375

版权

算法专栏收录该内容

8 篇文章 0 订阅

订阅专栏

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.

--------

用双指针，代表数组的第一个和最后一个，进行计算判断当前容器的最大值。如果左边比右边高度低，左边的指针往右移动，反之，右边的指针往左移动。

public int maxArea(int[] height) {
        if(height.length<2) return 0;
		int ans = 0;
		int left =0,right = height.length-1;
		while(left<right){
			int value = (right-left)*Math.min(height[left], height[right]);
			if(value > ans) ans = value;
			if(height[left]<height[right]){
				left++;
			}else{
				right--;
			}
		}
		return ans;
    }