Container With Most Water

[fkdl0048]

class Solution {
public:
    int maxArea(vector<int>& height) {
        int left =0;
        int right = height.size() - 1;
        int max = 0;
        int current = 0;

        while (left < right) {
            int wall = std::min(height[left], height[right]);
            current = wall * (right - left);
            
            if (current > max) {
                max = current;
            }

            if (height[left] < height[right]) {
                left++;
            } else {
                right--;
            }
        }

        return max;
    }
};

• Container With Most Water #34
• 저번 풀이와 비슷한 풀이로 나옴 투포인터 전략 문제