2139. Minimum Moves to Reach Target Score

class Solution {
public:
    int minMoves(int target, int maxDoubles) {
       int cnt = 0;
       
       while(target != 1)
       {
           if( maxDoubles == 0)  return (cnt + target-1);

           else if(target%2 == 1 && maxDoubles != 0)
           {
               target--;
               cnt++;
           }

           else if(target%2 == 0 && maxDoubles != 0)
           {
               target /= 2;
               maxDoubles--;
               cnt++;
           }

       }
       return cnt;
    }
};