Minimum Moves to Reach Target Score LeetCode solution in JavaScript

1
var minMoves = function (target, maxDoubles) {
2
  if (maxDoubles === 0) return target - 1;
3
  let count = 0;
4

5
  while (target > 1) {
6
    if (target % 2 === 0 && maxDoubles > 0) {
7
      target /= 2;
8
      maxDoubles--;
9
    } else {
10
      target--;
11
    }
12

13
    count++;
14
  }
15

16
  return count;
17
};