[LeetCode] 11. Container With Most Water
来源:互联网 发布:淘宝话费券 编辑:程序博客网 时间:2024/05/29 18:50
题目:https://leetcode.com/problems/container-with-most-water/description/
题目
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.
Solution
Approach #1 Brute Force [Time Limit Exceeded]
Algorithm
In this case, we will simply consider the area for every possible pair of the lines and find out the maximum area out of those.
Java
class Solution { public int maxArea(int[] height) { int maxarea = 0; for(int i=0;i<height.length;i++) for(int j =i+1;j<height.length;j++) maxarea = Math.max(maxarea,Math.min(height[i],height[j])*(j-i)); return maxarea; }}
但这会报错,时间超时。
Approach #2 (Two Pointer Approach) [Accepted]
Algorithm
The intuition behind this approach is that the area formed between the lines will always be limited by the height of the shorter line. Further, the farther the lines, the more will be the area obtained.
We take two pointers, one at the beginning and one at the end of the array constituting the length of the lines. Futher, we maintain a variable maxarea to store the maximum area obtained till now. At every step, we find out the area formed between them, update maxarea and move the pointer pointing to the shorter line towards the other end by one step.
The algorithm can be better understood by looking at the example below:
1 8 6 2 5 4 8 3 7
How this approach works?
Initially we consider the area constituting the exterior most lines. Now, to maximize the area, we need to consider the area between the lines of larger lengths. If we try to move the pointer at the longer line inwards, we won't gain any increase in area, since it is limited by the shorter line. But moving the shorter line's pointer could turn out to be beneficial, as per the same argument, despite the reduction in the width. This is done since a relatively longer line obtained by moving the shorter line's pointer might overcome the reduction in area caused by the width reduction.
For further clarification click here and for the proof click here.
Java
class Solution { public int maxArea(int[] height) { int lnode = 0; int rnode = height.length-1; int maxarea = 0; while(lnode<rnode){ maxarea = Math.max(maxarea,Math.min(height[lnode],height[rnode])*(rnode - lnode)); if(height[lnode]<height[rnode]) lnode++; else rnode--; } return maxarea; }}
Complexity Analysis
Time complexity : O(n). Single pass.
Space complexity : O(1). Constant space is used.
- LeetCode 11. Container With Most Water
- [LeetCode]11.Container With Most Water
- LeetCode --- 11. Container With Most Water
- LeetCode 11.Container With Most Water
- [Leetcode] 11. Container With Most Water
- [leetcode] 11.Container With Most Water
- 【leetcode】11. Container With Most Water
- [LeetCode]11. Container With Most Water
- 11. Container With Most Water LeetCode
- leetcode 11. Container With Most Water
- leetcode 11.Container With Most Water
- [LeetCode OJ]11. Container With Most Water
- [leetcode] 11. Container With Most Water
- Leetcode 11. Container With Most Water
- leetcode 11.Container With Most Water
- leetcode 11. Container With Most Water
- LeetCode 11. Container With Most Water
- LeetCode *** 11. Container With Most Water
- MySQL复制--master_info类成员变量说明
- python.pygal/random学习范例-模拟掷六面骰子点数次数生成直方图
- JavaScript高程学习笔记之BOM(8)
- 渐近符号
- 文章标题
- [LeetCode] 11. Container With Most Water
- 【概率论】作业一
- 文章标题
- HDU 3308 LCIS(线段树+区间合并+最长递增连续子串)
- LeetCode21. Merge Two Sorted Lists
- 机器学习心得之Andrew Ng(2)
- hdu4221(贪心)
- 《架构即服务--企业数字化运营架构设计与演进》缩略语
- 【概率论】作业二