Moving Stones Until Consecutive LeetCode solution in JavaScript

1
var numMovesStones = function (a, b, c) {
2
  const nums = [a, b, c];
3

4
  nums.sort((a, b) => a - b);
5

6
  const leftGap = nums[1] - nums[0] - 1;
7
  const rightGap = nums[2] - nums[1] - 1;
8

9
  const maxMoves = leftGap + rightGap;
10

11
  if (leftGap == 0 && rightGap == 0) return [0, 0];
12
  if (leftGap > 1 && rightGap > 1) return [2, maxMoves];
13
  return [1, maxMoves];
14
};