Find Target Indices After Sorting Array LeetCode solution in JavaScript

1
function binarySearch(lists, sorted, low, high, target) {
2
  if (low > high) return;
3

4
  const mid = low + Math.floor((high - low) / 2);
5

6
  if (sorted[mid] === target) {
7
    lists.push(mid);
8
  }
9

10
  binarySearch(lists, sorted, low, mid - 1, target);
11
  binarySearch(lists, sorted, mid + 1, high, target);
12
}
13

14
var targetIndices = function (nums, target) {
15
  let result = [];
16
  nums.sort((a, b) => a - b);
17
  if (!nums.includes(target)) return [];
18

19
  binarySearch(result, nums, 0, nums.length - 1, target);
20
  return result.sort((a, b) => a - b);
21
};