盛最多水容器

暴力解法,双重嵌套循环,复杂度O(n^2);

class Solution {
public:
    int maxArea(vector<int>& height) {
        int maxArea = 0;int area =0;
        for (int i = 0; i < height.size(); i++) {
            for (int j = i + 1; j < height.size(); j++) {
                area =min(height[i],height[j]) *(j - i);
                maxArea=max(maxArea,area);
                }
            }
        return maxArea;
    }
};

双指针,复杂度O(n)

class Solution {
public:
    int maxArea(vector<int>& height) {
        int maxArea = 0;
        int left = 0;
        int right = height.size() - 1;
        while (right > left) {
            int area = min(height[left], height[right]) * (right - left);
            maxArea = max(maxArea, area);
            if (height[left] > height[right]) {
                right--;
            } else
                left++;
        }
        return maxArea;
    }
};

. - 力扣（LeetCode）