Minimum Moves to Reach Target Score LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minMoves(int target, int maxDoubles) {
4
    int cnt = 0;
5
    while (target > 1 && maxDoubles > 0) {
6
      if (target % 2 == 0) {
7
        cnt++;
8
        maxDoubles--;
9
        target = target / 2;
10
      } else {
11
        cnt++;
12
        target--;
13
      }
14
    }
15
    return cnt + (target - 1);
16
  }
17
};