LeetCode 11. Container With Most Water题目分析代码

public class Solution {
    /**
     * @param heights: an array of integers
     * @return: an integer
     */
    int computeArea(int left, int right,  int[] heights) {
        return (right-left)*Math.min(heights[left], heights[right]);
    }
    
    public int maxArea(int[] heights) {
        //两根指针，一头一尾计算，短的那根指针向中间移动，因为只有这种情况才存在更大的情况
        int left = 0, right = heights.length-1;
        int res = 0;
        
        while(left < right) {
            res = Math.max(res, computeArea(left,right,heights));
            if(heights[left] < heights[right]) {
                left++;
                //如果小于则不必要计算，直接跳过
                while(heights[left] <= heights[left-1] && left<right)
                    left++;
            }
            else {
                right--;
                while(heights[right] <= heights[right+1] && left <right)
                    right--;
            }
        }
        return res; 
    }
}