[Java/Python 3] Find the max 2 numbers.
\n\njava\n    public int maxProduct(int[] nums) {\n        int mx1 = Integer.MIN_VALUE, mx2 = mx1;\n        for (int n : nums) {\n            if (n > mx1) {\n  
\n\n```java\n    public int maxProduct(int[] nums) {\n        int mx1 = Integer.MIN_VALUE, mx2 = mx1;\n        for (int n : nums) {\n            if (n > mx1) {\n                mx2 = mx1;\n                mx1 = n;\n            }else if (n > mx2) {\n                mx2 = n;\n            }\n        }\n        return (mx1 - 1) * (mx2 - 1);\n    }\n```\n\n```python\n    def maxProduct(self, nums: List[int]) -> int:\n        mx1 = mx2 = -math.inf\n        for n in nums:\n            if n > mx1:\n                mx2 = mx1\n                mx1 = n\n            elif n > mx2:\n                mx2 = n\n        return (mx1 - 1) * (mx2 - 1)\n```
[]