Add solution 1668、1669、1670、1672、1673

2025-07-25 12:14:26 +08:00 · 2020-12-16 03:08:19 +08:00
parent 2e796fe70e
commit e85f3236f4
30 changed files with 1266 additions and 428 deletions
--- a/leetcode/1673.Find-the-Most-Competitive-Subsequence/1673.
+++ b/leetcode/1673.Find-the-Most-Competitive-Subsequence/1673.
@ -0,0 +1,13 @@
+package leetcode
+
+// 单调栈
+func mostCompetitive(nums []int, k int) []int {
+	stack := make([]int, 0, len(nums))
+	for i := 0; i < len(nums); i++ {
+		for len(stack)+len(nums)-i > k && len(stack) > 0 && nums[i] < stack[len(stack)-1] {
+			stack = stack[:len(stack)-1]
+		}
+		stack = append(stack, nums[i])
+	}
+	return stack[:k]
+}