/leetcode 11/ container with most water - brute force : O(n^2)

leetcode11a.cpp

class Solution{
  public:
  int maxArea(vector<int>& height){
    int max = 0;
    for(int i = 0; i < height.size()-1 ; i++){
      for(int j = i+1; j < height.size() ; j++){
        int vertical = 0;
        if(height[i] < height[j])
          vertical = height[i];
        else
          vertical = height[j];
        
        int area = vertical * (j-i);
        if(max < area)
          max = area;
      }
    }
    return max;
  }
};