add 2874

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/Execute.kt

@@ -1,7 +1,9 @@
 package com.github.contest
 
 
-import com.github.contest.graph.mostProfitablePath
+import com.github.contest.array.maximumTripletValue
+import com.github.contest.array.maximumTripletValue
+
 import java.util.TreeMap
 
 
@@ -11,10 +13,11 @@ import java.util.TreeMap
 
 fun main() {
 
-//    val edges = arrayOf(intArrayOf(0, 1), intArrayOf(1, 2), intArrayOf(1, 3), intArrayOf(3, 4))
-//    mostProfitablePath(edges, 3, intArrayOf(-2, 4, 2, -4, 6)).also { println(it) }
-//
-    testing()
+    maximumTripletValue(
+        intArrayOf(
+            15, 3, 3, 18, 19, 13, 7, 5, 18, 1, 8, 5
+        )
+    ).also { println(it) }
 
 }
 
@@ -28,10 +31,7 @@ fun testing() {
 
 fun generateTesting() {
     val sequence = sequenceOf(3, 5, 6, 7, 7, 8, 8, 8, 9, 3)
-    sequence.map { it * 2 }
-        .filter { it > 3 }
-        .filter { it > 2 }
-        .constrainOnce()
+    sequence.map { it * 2 }.filter { it > 3 }.filter { it > 2 }.constrainOnce()
 
 
 }

contest/src/main/java/com/github/contest/array/ArrayLeetcode.kt

@@ -1,5 +1,6 @@
 package com.github.contest.array
 
+
 /**
  * 1800. Maximum Ascending Subarray Sum
  */
@@ -144,7 +145,7 @@ fun mergeArrays(nums1: Array<IntArray>, nums2: Array<IntArray>): Array<IntArray>
  * 2873. Maximum Value of an Ordered Triplet I
  */
 
-fun maximumTripletValue(nums: IntArray): Long {
+fun maximumTripletValueI(nums: IntArray): Long {
     var max = 0L
     for (i in nums.indices) {
         for (j in i + 1 until nums.size) {
@@ -158,6 +159,25 @@ fun maximumTripletValue(nums: IntArray): Long {
 }
 
 
+/**
+ * 2874. Maximum Value of an Ordered Triplet II
+ */
+
+
+fun maximumTripletValue(nums: IntArray): Long {
+    var maxi = Int.MIN_VALUE
+    var diff = 0
+    var res = 0L
+
+    for (i in nums.indices) {
+        maxi = maxOf(maxi, nums[i])
+        if (i >= 2) res = maxOf(res, (diff.toLong() * nums[i]))
+        if (i >= 1) diff = maxOf(diff, (maxi - nums[i]))
+    }
+
+    return res
+}
+