LeetCode --- 1464. Maximum Product of Two Elements in an Array 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1464. Maximum Product of Two Elements in an Array 解题报告相关的知识,希望对你有一定的参考价值。
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 <&
以上是关于LeetCode --- 1464. Maximum Product of Two Elements in an Array 解题报告的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode --- 1464. Maximum Product of Two Elements in an Array 解题报告
LeetCode --- 1464. Maximum Product of Two Elements in an Array 解题报告