11. Container With Most Water

最新推荐文章于 2024-10-29 13:54:07 发布

sunnylinner

最新推荐文章于 2024-10-29 13:54:07 发布

阅读量262

点赞数

分类专栏： LeetCode 文章标签： LeetCode java

本文链接：https://blog.csdn.net/sunnylinner/article/details/51089994

版权

LeetCode 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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 left = 0;
		int right = height.length-1;
		int max = 0,temp = 0;
		while(left<right) {
			if(height[left] > height[right]){
				temp = (right-left) * height[right];
				right--;
			}else{
				temp = (right-left) * height[left];
				left++;
			}
			max = max > temp ? max :temp;
		}
		return max;
    }
}
//从两端开始遍历数组，每次计算结果，那边数值高，则缩进，以此寻找最小的

//从两端开始遍历数组，每次计算结果，那边数值高，则缩进，以此寻找最小的