public int maxArea(int[] height) {
int left = 0, right = height.length - 1;
int maxArea = 0; while (left < right) {
maxArea = Math.max(maxArea, Math.min(height[left], height[right])
* (right - left));
if (height[left] < height[right])
left++;
else
right--;
} return maxArea;
}
相关文章
- Leetcode题解之Container With Most Water
- C++LeetCode:: Container With Most Water
- LeetCode第[11]题(Java):Container With Most Water 标签:Array
- 《LeetBook》leetcode题解(11):Container With Most Water[M] ——用两个指针在数组内移动
- leetcode面试准备:Container With Most Water
- Leetcode Array 11 Container With Most Water
- LeetCode题解——Container With Most Water
- leetcode problem 11 Container With Most Water
- LeetCode--11_Container_With_Most_Water
- Leed code 11. Container With Most Water