[LeetCode][Java] Container With Most Water

原创 2015年07月09日 10:01:38

题目:

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.


题意:

给定n个非负整数a1a2, ..., an, 每个代表在坐标(iai)上的一点,连接(iai) and (i, 0)形成n条垂直线。找出两条垂线,和x坐标形成一个容器,使得这个容器包含的水最多。

注意:你不可以倾斜容器。

算法分析:


    两边夹的策略


    两个指标i j往中间走。每次计算i和j之间的面积,如果比目前最大面积大,则更新最大面积,否则让两者之间较小的数的指标往前走。


    如果height[i] <= height[j],那么i++,因为在这里height[i]是瓶颈,j往里移只会减少面积,不会再增加area。


    这是一个贪心的策略,每次取两边围栏最矮的一个推进,希望获取更多的水。


AC代码:

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


版权声明:本文为博主原创文章,转载注明出处

LeetCode: Container With Most Water [Java]

Description: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordi...

leetcode解题之 11. Container With Most Water Java版(最大盛水容积)

leetcode解题之 11. Container With Most Water Java版(最大盛水容积)

【Leetcode】Container With Most Water in JAVA

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai)...

[LeetCode][11]Container With Most Water解析 时间复杂度为O(n) -Java实现

Q: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate...

LeetCode 11 Container With Most Water (C,C++,Java,Python)

Problem: Given n non-negative integers a1, a2, ..., an, where each represents a point at coor...

Leetcode Q11:Container With Most Water

题目11: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (...

LeetCode_Container With Most Water

Container With Most Water   Given n non-negative integers a1, a2, ..., an, where each repr...

【LeetCode】Container With Most Water

参考链接 题目描述 题目分析 总结 代码示例 推荐学习C++的资料 C++标准函数库 http://dow...

LeetCode | Container With Most Water

题目: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinat...

LeetCode011 Container With Most Water

详细见:leetcode.com/problems/container-with-most-water/ Java Solution: github package leetcode;...
  • zxwtry
  • zxwtry
  • 2017年03月28日 17:21
  • 100
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[LeetCode][Java] Container With Most Water
举报原因:
原因补充:

(最多只允许输入30个字)