leetcode11- Container With Most Water

1,C++解法：

class Solution {
public:
    int maxArea(vector<int>& height) {
    int i=0,j=height.size()-1,m=0;
        while(i<j)
        {
            m=max(m,min(height[i],height[j])*(j-i));
            height[i]<height[j]?i++:j--;
            
        }
        return m;
        
    }
};

2，java解法：

class Solution {
    public int maxArea(int[] height) {
        int i=0,j=height.length-1,m=0,a;
        while(i<j)
        {
            m=Math.max(m,Math.min(height[i],height[j])*(j-i));
            a=height[i]<height[j]?i++:j--;
            
        }
        return m;
    }
}

3，python解法：

class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        i,j,m=0,len(height)-1,0
        while i<j:
            m=max(m,min(height[i],height[j])*(j-i))
            if height[i]<height[j]:
                i=i+1 
            else:
                j=j-1
        return m