LeetCode之双指针(3)
2016-01-08 10:32
232 查看
11. Container With Most Water
题目链接:https://leetcode.com/problems/container-with-most-water/
题目描述:
给一个高度数组,代表x轴上有一些给定高度的竖线,求两条竖线与x轴构成的容器能容纳最大多少的水面积。
题目分析:
curCapacity=min(height[low],height[high])*(high-low)
感谢
http://www.th7.cn/Program/c/201505/447082.shtml
一开始没懂题几个意思啊,求能装多少水,这咋算底面积啊。
双指针,一个从头开始走,一个从尾开始走,高度小的前进,为看之后有没有高度大的来更新curCapacity。
代码:
class Solution { public: int maxArea(vector<int>& height) { int low=0; int high=height.size()-1; int capacity=0; int cur=0; while(low<high){ cur=min(height[low],height[high])*(high-low); if(capacity<cur){ capacity=cur; } if(height[low]>height[high]){ high--; } else{ low++; } } return capacity; } };
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解