1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
#include "leetcode.h" class Solution { public: int numberOfSteps(int num) { int steps = 0; while (num) { if (num % 2 == 0) num /= 2, steps++; else num--, steps++; } return steps; } }; int main() { Solution obj; cout << obj.numberOfSteps(1043); }