#2873
Maximum Value of an Ordered Triplet I
pupil · 390 · lc easy +24 · verified · 58.2% accepted · 689 likes · top 54%
Description
A 0-indexed integer array nums is given.
Over all ordered index triplets (i, j, k) with i < j < k, return the maximum value of (nums[i] - nums[j]) * nums[k]. If every such triplet produces a negative value, return 0.
Example 1:
Input: nums = [12,6,1,2,7]
Output: 77
Explanation: The value of the triplet (0, 2, 4) is (nums[0] - nums[2]) * nums[4] = 77.
It can be shown that there are no ordered triplets of indices with a value greater than 77.
Example 2:
Input: nums = [1,10,3,4,19]
Output: 133
Explanation: The value of the triplet (1, 2, 4) is (nums[1] - nums[2]) * nums[4] = 133.
It can be shown that there are no ordered triplets of indices with a value greater than 133.
Example 3:
Input: nums = [1,2,3]
Output: 0
Explanation: The only ordered triplet of indices (0, 1, 2) has a negative value of (nums[0] - nums[1]) * nums[2] = -3. Hence, the answer would be 0.
Code
1
2
3