【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 and n is at least 2.

--------

用雙指針，代表數組的第一個和最後一個，進行計算判斷當前容器的最大值。如果左邊比右邊高度低，左邊的指針往右移動，反之，右邊的指針往左移動。

public int maxArea(int[] height) {
        if(height.length<2) return 0;
		int ans = 0;
		int left =0,right = height.length-1;
		while(left<right){
			int value = (right-left)*Math.min(height[left], height[right]);
			if(value > ans) ans = value;
			if(height[left]<height[right]){
				left++;
			}else{
				right--;
			}
		}
		return ans;
    }