Minimum Moves to Reach Target Score LeetCode solution in Java

1
class Solution {
2
  public int minMoves(int target, int maxDoubles) {
3
    int ans = 0;
4
    for (int i = 0; i < maxDoubles; i++) {
5
      if (target == 1) break;
6

7
      if (target % 2 == 0) {
8
        ans += 1;
9
        target = (target) / 2;
10
      } else {
11
        ans += 2;
12
        target = (target - 1) / 2;
13
      }
14
    }
15
    return ans + target - 1;
16
  }
17
}