Container With Most Water

class Solution {

  public:
    int maxWater(vector<int> & height) {
               int n = height.size();
        int i = 0, j=n-1;
        int ans = 0, res = 0;
        while(i<j) {
            ans = (j-i) * min(height[i], height[j]);
            res = max(res, ans);
            if(height[i] < height[j]) i++;
            else j--;
        }
        return res;
    }
};