Minimum Subsequence in Non-Increasing Order LeetCode solution in Java

1
class Solution {
2
  public List<Integer> minSubsequence(int[] nums) {
3
    int total = 0;
4
    for (int i = 0; i < nums.length; i++) {
5
      total += nums[i];
6
    }
7
    Arrays.sort(nums);
8
    int sum = 0;
9
    ArrayList<Integer> ans = new ArrayList<>();
10
    for (int i = nums.length - 1; i >= 0; i--) {
11
      ans.add(nums[i]);
12
      sum += nums[i];
13
      if (sum > total - sum) {
14
        return ans;
15
      }
16
    }
17
    return ans;
18
  }
19
}