LeetCode11. Container With Most Water

题意

• n条线段, 求两条线段, 使得其与X轴组成的最大矩形, 以短的线段为宽

解法

• 双指针

代码

int maxArea(vector<int>& height) {
    int N = height.size();
    int lo = 0, hi = N-1;
    long long ans = 0;
    while (lo < hi) {
        long long res = min(height[lo], height[hi]) * (hi - lo);
        ans = max(res, ans);
        (height[lo] < height[hi]) ? lo++ : hi--;
    }

    return ans;
}