1464. Maximum Product of Two Elements in an Array #

class Solution {
    public int maxProduct(int[] nums) {
        int[] ans = new int[2];
        
        for (int num: nums) {
            if (ans[0] == 0) ans[0] = num;
            else {
                if (num >= ans[0]) {
                    ans[1] = ans[0];
                    ans[0] = num;
                }
                else if (num >= ans[1]) ans[1] = num;
            }
        }
        return (ans[0] - 1) * (ans[1] - 1);
    }
}