Class Solution
-
- All Implemented Interfaces:
public final class Solution3584 - Maximum Product of First and Last Elements of a Subsequence.
Medium
You are given an integer array
numsand an integerm.Return the maximum product of the first and last elements of any subsequences of
numsof sizem.Example 1:
Input: nums = -1,-9,2,3,-2,-3,1, m = 1
Output: 81
Explanation:
The subsequence
[-9]has the largest product of the first and last elements:-9 * -9 = 81. Therefore, the answer is 81.Example 2:
Input: nums = 1,3,-5,5,6,-4, m = 3
Output: 20
Explanation:
The subsequence
[-5, 6, -4]has the largest product of the first and last elements.Example 3:
Input: nums = 2,-1,2,-6,5,2,-5,7, m = 2
Output: 35
Explanation:
The subsequence
[5, 7]has the largest product of the first and last elements.Constraints:
<code>1 <= nums.length <= 10<sup>5</sup></code>
<code>-10<sup>5</sup><= numsi<= 10<sup>5</sup></code>
1 <= m <= nums.length
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final LongmaximumProduct(IntArray nums, Integer m)-
-
Method Detail
-
maximumProduct
final Long maximumProduct(IntArray nums, Integer m)
-
-
-
-