LeetCode 11. Container With Most Water
Solution1:
参考网址:http://www.cnblogs.com/grandyang/p/4455109.html
定义两个指针向中间走,贪心啊。。
class Solution {//
public:
int maxArea(vector<int>& height) {
int water = 0;
int i = 0, j = height.size() - 1;
while (i < j) {
int h = min(height[i], height[j]);
water = max(water, (j - i) * h);
while (height[i] <= h && i < j) i++;
while (height[j] <= h && i < j) j--;
}
return water;
}
};