LeetCode: 1403. Minimum subsequence in non-increasing order [greedy]

topic description

Things

Sort the nums, starting with the largest number, until those numbers greater than the sum of the total are selected.

AC Code

class Solution:def minSubsequence(self, nums: List[int]) -> List[int]:nums.sort(reverse = True)tot, cur = sum(nums), 0for i in range(len(nums)):cur += nums[i]if cur > tot /2 :return nums[: i+1]