盛最多水的容器 2021.11.29

这道题如果对时间复杂度没有要求的话可以用双循环暴力枚举解决问题；但是人家偏偏就对时间复杂度有要求，这个时候就要考虑到双指针了！具体代码如下：

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class test18 {
    
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] str = br.readLine().split(",");
        int[] height = new int[str.length];
        for(int i=0; i< str.length; i++){
            height[i] = Integer.parseInt(str[i]);
        }

        System.out.println(maxArea(height));

    }

    public static int maxArea(int[] height){
        int maxArea = 0, minHeight = 0;

        //采用双指针思想
        int left = 0, right = height.length-1;
        while(left < right){
            minHeight = height[left] < height[right] ? height[left] : height[right];
            if( (right - left)*minHeight >maxArea ){
                maxArea = (right - left)*minHeight;
            }
            if(height[left] < height[right]){
                left++;
            }else{
                right--;
            }
        }

        return maxArea;
    }
}