leetcode Container With Most Water 难度系数3 3.4
2014-01-28 12:02
411 查看
Question:
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.
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.
public class Solution { public int maxArea(int[] height) { if (height.length==0) { return 0; } int first = 0; int last = height.length-1; int area = 0; int result = 0; int minHeight = 0; while(first<last){ minHeight = Math.min(height[first], height[last]); area = minHeight*(last-first); result = Math.max(area, result); if (height[first]<=height[last]) { first++; }else { last--; } } return result; } }
相关文章推荐
- LeetCode Container With Most Water (Two Pointers)
- LeetCode之11---Container With Most Water
- [Leetcode]Container With Most Water
- [leetcode javascript解题]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
- LeetCode 011 Container With Most Water
- LeetCode-11:Container With Most Water
- [LeetCode]-011-Container With Most Water
- [C++]LeetCode 11: Container With Most Water(最大容积/最大矩形面积)
- 开始刷leetcode day17:Container With Most Water
- [leetcode]Container With Most Water
- Leetcode - Container With Most Water
- LeetCode Container With Most Water
- leetcode-011-Container With Most Water
- [Leetcode] Container With Most Water
- LeetCode 11 - Container With Most Water
- 刷LeetCode(11)——Container With Most Water