class Solution { public int numberOfSteps(int num) {
if(num == 0) {
return 0;
}
int steps = 0;
while(num != 0) {
steps += (num & 1) + 1;
num >>= 1;
}
return steps - 1;
} }
-
Notifications
You must be signed in to change notification settings - Fork 0
12-malak/setps
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published