LeetCode Container With Most Water

class Solution {
public:
    int maxArea(vector<int> &height) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int start = 0;
        int end = height.size() - 1;
        
        int water = 0;
        
        while (start < end) { 
            water = max(water, min(height[start], height[end]) * (end - start));
            
            if (height[start] < height[end]) {
                start++;
            }
            else {
                end--;                
            }
        }
        
        return water;
    }
};