Simple easy approach loop solution✅✅
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int maxProduct(int[] nums) {\n        int first=0, second=0;\n        for(int i=0; i<nums.length; i++){\n            if(nums[i]>=first){\n                second = first;\n                first = nums[i];\n            }\n            else if(nums[i]>second)    second = nums[i];\n        }\n        return (first-1) * (second-1);\n    }\n}\n```
['Array', 'Java']