Package g2801_2900.s2873_maximum_value_of_an_ordered_triplet_i

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2873 - Maximum Value of an Ordered Triplet I.

    Easy

    You are given a 0-indexed integer array nums.

    Return the maximum value over all triplets of indices (i, j, k) such that i < j < k. If all such triplets have a negative value, return 0.

    The value of a triplet of indices (i, j, k) is equal to (nums[i] - nums[j]) * nums[k].

    Example 1:

    Input: nums = 12,6,1,2,7

    Output: 77

    Explanation: The value of the triplet (0, 2, 4) is (nums0 - nums2) \* nums4 = 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 (nums1 - nums2) \* nums4 = 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 (nums0 - nums1) \* nums2 = -3. Hence, the answer would be 0.

    Constraints:

    • 3 <= nums.length <= 100

    • <code>1 <= numsi<= 10<sup>6</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Long maximumTripletValue(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait