LeetCode1464

public class LeetCode1464 {

    public int maxProduct(int[] nums) {
        Arrays.sort(nums);
        return (nums[nums.length - 1] - 1) * (nums[nums.length - 2] - 1);
    }

    public static int maxProduct2(int[] nums) {
        int x = 0, y = 0;
        for (int num : nums) {
            if (num > x) {
                y = x;
                x = num;
            } else if (num > y) {
                y = num;
            }
        }
        return (x - 1) * (y - 1);
    }

    public static void main(String[] args) {
        int[] nums = {3, 4, 5, 2};
        System.out.println(maxProduct2(nums));
    }
}