LeetCode – Refresh – Container With Most Water

The minimum height controls the volumns. So let two runner at two ends start to scan the array.

 

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