describe

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. 	
Copy the code

Example 2:

Input: nums = [1,5,4,5]
Output: 16
Explanation: Choosing the indices i=1 and j=3 (indexed from 0), you will get the maximum value of (5-1)*(5-1) = 16.
Copy the code

Example 3:

Input: nums = [3,7]
Output: 12
Copy the code

Note:

2 <= nums.length <= 500
1 <= nums[i] <= 10^3
Copy the code

parsing

Find the largest two elements and subtract one from each other. Just sort the array, subtract the last two elements and multiply them.

answer

class Solution(object):
    def maxProduct(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums.sort()
        return (nums[-1]-1) * (nums[-2]-1)
        	      
		
Copy the code

The results

Runtime: 10 ms, faster than 86.47% of Python online submissions for Maximum Product of Two Elements in an Array. Memory Usage: Submissions in Python online submissions for Maximum Product of Two Elements in an Array.Copy the code

Original link: leetcode.com/problems/ma…

Your support is my biggest motivation