int maxResult = 0;
int l = 0;
int r = height.length - 1;
for(int i = 0; i<height.length; i++){
maxResult = Math.max(maxResult, Math.min(height[l],height[r])*(r-l));
if(height[l] >= height[r]){
r--;
}else{
l++;
}
}
return maxResult;