Java || 100% || 0(N)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:0(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:0(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int maxProduct(int[] nums) {\n        int max1 = 0 , max2 = 0;\n        for(int i=0; i<nums.length; i++){\n            if(nums[i]>=max1 || nums[i]>=max2){\n                max2 = Math.max(max1,max2);\n                max1 = nums[i];\n            }   \n        }\n        return (max1-1)*(max2-1);\n    }\n}\n```
['Java']