test: 3542 solution

go

Author: QuBenhao

problems/problems_3542/solution.go

@@ -6,8 +6,23 @@ import (
 	"strings"
 )
 
-func minOperations(nums []int) int {
-    
+func minOperations(nums []int) (ans int) {
+	var minStack []int
+	for _, num := range nums {
+		// 左边每个更大的元素都需要一次操作，因为当前为割点
+		for len(minStack) > 0 && num < minStack[len(minStack)-1] {
+			minStack = minStack[:len(minStack)-1]
+			ans++
+		}
+		if len(minStack) > 0 && num == minStack[len(minStack)-1] {
+			continue
+		}
+		minStack = append(minStack, num)
+	}
+	if minStack[0] == 0 {
+		ans--
+	}
+	return ans + len(minStack)
 }
 
 func Solve(inputJsonValues string) interface{} {

problems/problems_3542/solution.py

@@ -13,18 +13,17 @@ def minOperations(self, nums: List[int]) -> int:
         left_idx = [-1] * n
         right_idx = [n] * n
         min_stack = []
+        strict_min_stack = []
         for i, num in enumerate(nums):
             while min_stack and num < nums[min_stack[-1]]:
                 idx = min_stack.pop()
                 right_idx[idx] = i
+            while strict_min_stack and num <= nums[strict_min_stack[-1]]:
+                strict_min_stack.pop()
             if num == 0:
                 left_idx[i] = inf
+            else:
+                left_idx[i] = strict_min_stack[-1] if strict_min_stack else -1
             min_stack.append(i)
-        min_stack = []
-        for i in range(n-1, -1, -1):
-            num = nums[i]
-            while min_stack and num < nums[min_stack[-1]]:
-                idx = min_stack.pop()
-                left_idx[idx] = i
-            min_stack.append(i)
+            strict_min_stack.append(i)
         return len(set((l, r) for l, r in zip(left_idx, right_idx) if l != inf))