leetcode-011:Container With Most Water

class Solution {
public:
int maxArea(vector<int> &height) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int result=0;
if(height.size()<=1) return result;

int i=0,j=height.size()-1;
while(i<j)
{
result=max(result,(j-i)*min(height[i],height[j]));
if(height[i]<height[j])
i++;
else
j--;
}
return result;
}
};