11. Container With Most Water
2017-09-07 10:47
387 查看
题目
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.
思路
维护两个下标i=0,j=height.size()-1,从数组两侧遍历,求面积的最大值,然后判断i,j对应的数值大小,height[i]代码
class Solution { public: int maxArea(vector<int>& height) { int i=0,j=height.size()-1,mx=0; while(i<j) { mx = max((j-i)*min(height[i],height[j]),mx); if(height[i]<height[j]) i++; else j--; } return mx; } };
相关文章推荐
- 11. Container With Most Water
- [Leetcode] 11 Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- leetcode-11 Container With Most Water
- leetcode11 Container With Most Water
- 11. Container With Most Water
- 11 Container with most water
- LeetCode11: 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
- 11. Container With Most Water
- LeetCode 11 Container With Most Water
- [C++]LeetCode 11: Container With Most Water(最大容积/最大矩形面积)
- 11. Container With Most Water
- 11. Container With Most Water
- Leetcode 11 Container With Most Water
- 11. Container With Most Water