[LeetCode]#1464. Maximum Product of Two Elements in an Array

Environment: Python 3.7

Key technique: sorted

Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)*(nums[j]-1).

Example 1:

Input: nums = [3,4,5,2]
Output: 12 
Explanation: If you choose the indices i=1 and j=2 (indexed from 0), you will get the maximum value, that is, (nums[1]-1)*(nums[2]-1) = (4-1)*(5-1) = 3*4 = 12.

Analysis:

1. Sort nums from bigger to smaller one.
2. return (nums[0]-1) x (nums[1]-1)

Solution:

class Solution:
    def maxProduct(self, nums):
        l=len(nums)
        nums=sorted(nums,reverse=True)
        return (nums[0]-1)*(nums[1]-1)

Submissions: