题解 | #盛水最多的容器#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param height int整型一维数组 
     * @return int整型
     */
    public int maxArea (int[] height) {
        // write code here
        int maxResult = 0;


        if(height.length < 100){
            for(int i = 0; i < height.length - 1; i++){
                int temp = height[i];
                for(int j = i + 1; j < height.length; j++){
                    int low = temp <= height[j] ? temp : height[j];
                    if(low * (j - i) > maxResult)
                        maxResult = low * (j - i);
                }
            }
        }else {
            for(int i = 0; i < height.length - 1; i++){
                int temp = height[i];
                for(int j = i + height.length / 2; j < height.length; j++){
                    int low = temp <= height[j] ? temp : height[j];
                    if(low * (j - i) > maxResult)
                        maxResult = low * (j - i);
                }
            }
        }

        return maxResult;
    }
}