11. Container With Most Water
2018-03-07 23:34
288 查看
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.水池问题两个index一个指向数组头一个指向数组尾,L的高度小于R的高度,则L向后一个位置每次移动求出面积,并保留最大面积class Solution(object):
def maxArea(self, height):
"""
:type height: List[int]
:rtype: int
"""
ret, l, r = 0, 0, len(height)-1
while l != r:
ret = max(ret, min(height[l], height[r]) * (r-l))
if height[l] < height[r]:
l += 1
else:
r -= 1
return ret
def maxArea(self, height):
"""
:type height: List[int]
:rtype: int
"""
ret, l, r = 0, 0, len(height)-1
while l != r:
ret = max(ret, min(height[l], height[r]) * (r-l))
if height[l] < height[r]:
l += 1
else:
r -= 1
return ret
相关文章推荐
- LeetCode 11 Container With Most Water
- leetcode 11 Container With Most Water
- 11. Container With Most Water
- [11]Container With Most Water
- 11. Container With Most Water
- leetcode_11_Container With Most Water
- leetcode 11 -- Container With Most Water
- [leetcode-11]container with most water(C)
- LeetCode 11 Container With Most Water
- [LeetCode][11]Container With Most Water解析 时间复杂度为O(n) -Java实现
- Leetcode-11: Container With Most Water
- LeetCode11-Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 【小熊刷题】Container with Most Water <Leetcode 11, Java>
- LeetCode (11): Container With Most Water
- LeetCode(11) Container With Most Water
- 11. Container With Most Water
- 11【Leetcode】 Container With Most Water
- LeetCode OJ 11 Container With Most Water