题目 解法:贪心加栈 class Solution: def mostCompetitive(self, nums: List[int], k: int) -> List[int]: stack = [] n = len(nums) for i,num in enumerate(nums): while stack and stack[-1]>num and (n-i)+len(stack)>k: stack.pop() stack.append(num) return stack[0:k]