leetcode[11]Container With Most Water
2015-02-10 13:48
357 查看
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.
Note: You may not slant the container.
class Solution { public: int maxArea(vector<int> &height) { int i=0,j=height.size()-1; int res=0; while(i<j) { res=max(res,min(height[i],height[j])*(j-i)); (height[i]<height[j])?i++:j--; } return res; } };
相关文章推荐
- [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, Medium] Container With Most Water
- LeetCode 11 - Container With Most Water
- leetcode 11 -- Container With Most Water
- LeetCode42/11 Trapping Rain Water/Container With Most Water/Hist area**
- LeetCode 11 Container With Most Water (C,C++,Java,Python)
- 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
- Container With Most Water - LeetCode 11
- [Leetcode 43] 11 Container With Most Water
- LeetCode 11 Container With Most Water