only in one loop java
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 ans =0;\n        Arrays.sort(nums);\n        //return(nums[nums.length-1]-1 * nums[nums.length-2]-1);\n        for(int i =0; i<nums.length; i++){\n            ans = (nums[nums.length-1]-1) * (nums[nums.length-2]-1);\n\n        }\n        return ans;\n        \n    }\n}\n```
['Java']