1673. 找出最具竞争力的子序列

找出最具竞争力的子序列

• 难度: medium
• 原始链接: https://leetcode.cn/problems/find-the-most-competitive-subsequence
• 标签: 单调栈

解法一: 单调栈

go

func mostCompetitive(nums []int, k int) []int {
  stack := []int{}
  n := len(nums)
  for i, num := range nums {
    for len(stack) > 0 && stack[len(stack)-1] > num && (len(stack)-1+n-i) >= k {
      stack = stack[:len(stack)-1]
    }
    if len(stack) < k {
      stack = append(stack, num)
    }
  }
  return stack
}