1464. maximum product of two elements in an array

introduce

Give you an array of integers nums, Please select two different subscripts of the array i and j, send (nums[i]-1)*(nums[j]-1) Get the maximum .

Please calculate and return the maximum value of the formula .

Example

Input ：nums = [3,4,5,2]
Output ：12
explain ： If subscript is selected i=1 and j=2（ Subscript from 0 Start ）, The maximum value can be obtained ,(nums[1]-1)(nums[2]-1) = (4-1)(5-1) = 3*4 = 12 .

Input ：nums = [1,5,4,5]
Output ：16
explain ： Select subscript i=1 and j=3（ Subscript from 0 Start ）, The maximum value can be obtained (5-1)*(5-1) = 16 .

Input ：nums = [3,7]
Output ：12

Answer key

2160. The smallest sum of the last four digits after splitting
Let's take a look at my question yesterday , We can find that the solution can be the same , One is to find the smallest two , One is to find the two largest ;

direct sort The sorting is over ~

class Solution {
    
public:
    int maxProduct(vector<int>& nums) {
    
        int len = nums.size();
        sort(nums.begin(),nums.end());
        return (nums[len-1]-1)*(nums[len-2]-1);
    }
};