leetcode每日一题——11
class Solution {
    public int maxArea(int[] height) {
        int res=0;
int left=0,right=height.length-1;
while&nbsp;(left<right)&nbsp;{
res=Math.max(res,&nbsp;Math.min(height[left],&nbsp;height[right])*(right-left));
if&nbsp;(height[left]<height[right])&nbsp;left++;
else&nbsp;right--;
}
return&nbsp;res;
&nbsp;&nbsp;&nbsp;&nbsp;}
}