11. Container With Most Water(装最多的水 双指针)

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.

 

 

l = 0 

r = n-1

a[l] <a[r]

l++

那边矮扔掉哪边

 

 

class Solution {
public:
    int maxArea(vector<int>& height) {
        int low = 0;
        int high = height.size() -1;
        int res = 0;
        while(low < high) {
            int cur_res = min(height[high],height[low]) * (high-low);
            res = max(res,cur_res);
            if (height[low] < height[high]) low++;
            else if (height[low] > height[high]) high--;
            else if (height[low] == height[high]) low++;// high--  is the same
        }
        return res;
    }
};