leetcode hot 09

合集 - leetcode hot100(25)

1.leetcode hot 0102-152.leetcode hot 0202-153.leetcode hot 0402-164.leetcode hot 0302-155.leetcode hot 0502-176.leetcode hot 0602-197.leetcode hot 0702-208.leetcode hot 0802-21

9.leetcode hot 0902-21

10.leetcode hot 1002-2411.leetcode hot 1202-2512.leetcode hot 1302-2613.leetcode hot 1402-2814.leetcode hot 1503-0115.leetcode hot 1103-0316.leetcode hot 1603-0317.leetcode hot 1703-0318.leetcode hot 1803-0319.leetcode hot 1903-0420.leetcode hot 2003-0521.leetcode hot 2103-0522.leetcode hot 2203-1223.leetcode hot 2303-1224.leetcode hot 2403-1225.leetcode hot 2503-12

收起

解题思路:双指针另一种思路就是两个指针从数组两边往中间走，碰到符合条件的记录下来。两个指针一开始在最两边，底边一定是最长的，记录此时的面积，然后选取两者中较短的往对方靠拢，因为底边缩短，如果面积要出现更大的，一定是较短的变长了，依靠这个思路继续遍历直到left==right，最后返回记录的最大的面积值。

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