Description
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
Constraints:
2 <= nums.length <= 5001 <= nums[i] <= 10^3
Solutions
This solution takes a more direct approach: instead of computing a running product, it makes a single pass through nums to track the two largest values seen so far, max1 and max2 — updating both whenever a bigger number is found — and once the loop finishes, it simply returns (max1 - 1) * (max2 - 1), the product of the two biggest numbers minus one.
Language: javascript(2026-07-27 07:09)DONE
CPU Performance100.00%
Memory Performance58.99%
/**
* @param {number[]} nums
* @return {number}
*/
var maxProduct = function(nums) {
let max1 = 0;
let max2 = 0;
for (const num of nums) {
if (num > max1) {
max2 = max1;
max1 = num;
} else if (num > max2) {
max2 = num;
}
}
return (max1 - 1) * (max2 - 1);
};