非递增顺序的最小子序列

/*
 * Solution Idea:
 * 1. Sort the array in descending order using Java Streams.
 * 2. Collect the sorted array into a list.
 * 3. Calculate the total sum of the array and then accumulate the elements in the list until the accumulated sum is greater than half of the total sum.
 * 4. Return the list.
 */
import java.util.*;
import java.util.stream.*;

public class Solution {
    public List<Integer> minSubsequence(int[] nums) {
        int totalSum = Arrays.stream(nums).sum();
        List<Integer> sortedList = Arrays.stream(nums)
                                         .boxed()
                                         .sorted(Comparator.reverseOrder())
                                         .collect(Collectors.toList());
        List<Integer> result = new ArrayList<>();
        int subSum = 0;
        for (int num : sortedList) {
            subSum += num;
            result.add(num);
            if (subSum > totalSum - subSum) break;
        }
        return result;
    }
}