leetcode - Container With Most Water

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container.

分析：先将最左和最右两个点形成的面积作为基准面积，这时x轴的底最大，当左右两个点其中一个点向中间移动时，其底必然变小，要让面积变大，其高必须变大，也就是左右两点的低点向中间移动，直到遇到比它高的点

class Solution {
public:
    int maxArea(vector<int> &height) {
        int n = height.size();
        int maxArea = 0;
        int tempArea;
        int temp;
        int i = 0;
        int j = n-1;
        while(i < j)
        {
            if(height[i] < height[j])
            {
                tempArea = height[i]*(j-i);
                if(tempArea > maxArea)maxArea = tempArea;
                temp = height[i];
                while((temp >= height[i])&&(i < j))i++;
            }
            else if(height[i] > height[j])
            {
                tempArea = height[j]*(j-i);
                if(tempArea > maxArea)maxArea = tempArea;
                temp = height[j];
                while((temp >= height[j])&&(j > i))j--;
            }
            else
            {
                tempArea = height[i]*(j-i);
                if(tempArea > maxArea)maxArea = tempArea;
                temp = height[i];
                while((temp >= height[i])&&(i < j))i++;
                while((temp >= height[j])&&(j > i))j--;
            }
        }
        return maxArea;
    }
};