LeetCode | #11 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.

思路：

• 暴力枚举，两个for循环，O(N^2)，超时
• 一遍循环即可，设头尾两指针，height[i]>height[j]，j--，否则i++，直到i=j，每次都计算容量，和最大值比较。

/*//暴力试，O(N^2)，超时
	public int maxArea(int[] height) {
        int n = height.length, h = 0, t = 0, m = 0;
		for(int i=0; i<n; i++){
			for(int j=i+1; j<n; j++){
				h = height[i]>height[j]?height[i]:height[j];
				t = h*(j-i);
				m = t>m?t:m;
			}
		}
		return m;
    }*/

	//头尾指针，height[i]>height[j]，j--，否则i++
	public int maxArea(int[] height) {
        int n = height.length, i = 0, j = n-1, h = 0, c = 0, m = 0;
        while(i<j){
        	h = height[i]>height[j]?height[j]:height[i];
        	c = h*(j-i);
        	if(height[i]<height[j]){
        		i++;
        	}else{
        		j--;
        	}
        	m = c>m?c:m;
        }
        return m;
    }