Minimum Subsequence in Non-Increasing Order LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @return {number[]}
4
 */
5
var minSubsequence = function (nums) {
6
  const target = nums.reduce((a, b) => a + b) / 2;
7
  nums.sort((a, b) => b - a);
8
  let i = 0,
9
    sum = 0;
10
  while (sum <= target) {
11
    sum += nums[i++];
12
  }
13
  return nums.slice(0, i);
14
};