leetcode

0 class Solution {

1 public:

2 int numberOfSteps(int num) {

3 int res = 0;

4 while (num) {

5 res++;

6 if (num % 2 == 0)

7 num /= 2;

8 else

9 num--;

10 }

11 return res;

12 }

13 };