Minimum Subsequence in Non-Increasing Order LeetCode solution in Python

1
class Solution:
2
    def minSubsequence(self, nums: List[int]) -> List[int]:
3
        nums.sort(reverse=True)
4
        val = sum(nums)
5
        temp = []
6
        for i in range(len(nums)):
7
            temp.append(nums[i])
8
            if sum(temp) > val - sum(temp):
9
                return temp