题目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] # 累加最大数 r