leetcode-4.12[1403. 非递增顺序的最小子序列、5380. 数组中的字符串匹配、5381. 查询带键的排列](p...

题目1 题解1 class Solution: def minSubsequence(self, nums: List[int]) -> List[int]: nums.sort(reverse=True) # 从大到小排序 sum_ = 0 res = [] for i in range(len(nums)): sum_ += nums[i] # 累加最大数 res.append(nums[i]) if sum_ > sum([num for