【LeetCode】Container With Most Water

class Solution {
public:
    int maxArea(vector<int> &height) {
        int start = 0;
	int end = height.size() - 1;
	int result = INT_MIN;
	while (start < end)
	{
		int tmp = min(height[start], height[end])*(end - start);
		result = max(tmp, result);
		if (height[start] < height[end])
		{
			start++;
		}
		else
		{
			end--;
		}
	}
	return result;
    }
};