container-with-most-water

gistfile1.txt

/*

https://leetcode.com/problems/container-with-most-water/

Did I clearly understand the problem?

Is the given input is sorted? No

|       |
|    |  |  | 
| |  |  |  |  |  |
|------------------

MAX = abs(x_1, x_1) * min(y_2, y_1) 

Simple solution : exhaustive comparison O(N^2)

*/

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