描述
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.
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.
Example 3:
Input: nums = [3,7]
Output: 12
Note:
2 <= nums.length <= 500
1 <= nums[i] <= 10^3
解析
根据题意，找出最大的两个元素，求各自减一的乘积，只需要将数组排序，将最后两个元素拿出来各自减一再相乘即可。
解答
class Solution(object):
def maxProduct(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
nums.sort()
return (nums[-1]-1) * (nums[-2]-1)
运行结果
Runtime: 32 ms, faster than 86.47% of Python online submissions for Maximum Product of Two Elements in an Array.
Memory Usage: 13.2 MB, less than 99.00% of Python online submissions for Maximum Product of Two Elements in an Array.
原题链接：https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/