leetcode Container With Most Water
2017-11-21 13:49
561 查看
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.
题意:给定一组非负整数a1~an,代表二位坐标系中的点(i, ai),可以画出从(i,ai)到(i,0)的n条线,找到两条线,使其和x轴围成的木桶容积最大。
思路:从容器两端同时开始找,计算对应的容积,找出最大的,时间复杂度O(n)。
Note: You may not slant the container and n is at least 2.
题意:给定一组非负整数a1~an,代表二位坐标系中的点(i, ai),可以画出从(i,ai)到(i,0)的n条线,找到两条线,使其和x轴围成的木桶容积最大。
思路:从容器两端同时开始找,计算对应的容积,找出最大的,时间复杂度O(n)。
class Solution { public: int maxArea(vector<int>& height) { int water = 0; int i = 0, j = height.size() - 1; while (i < j) { int h = min(height[i], height[j]); water = max(water, (j - i) * h); //找到下一个比当前容积大的木桶 while (height[i] <= h && i < j) ++i; while (height[j] <= h && i < j) --j; } return water; } };
相关文章推荐
- LeetCode(11) Container With Most Water
- Leetcode | Container With Most Water
- 11. Container With Most Water LeetCode题解
- leetcode题解||Container With Most Water问题
- LeetCode | #11 Container With Most Water
- 【LeetCode从零单刷】Container With Most Water
- 【LeetCode】Container With Most Water
- LeetCode:Container With Most Water
- [LeetCode]Container With Most Water
- leetcode Container With Most Water
- leetcode—Container With Most Water
- Leetcode练习 #11 Container With Most Water
- Leetcode 11 Container With Most Water
- [LeetCode]Container With Most Water
- Container With Most Water --- LeetCode
- LeetCode11:Container With Most Water
- Leetcode || Container With Most Water
- LeetCode | Container with most water(装最多的水)
- LeetCode - 11 - Container With Most Water
- 【LeetCode】Container With Most Water