LeetCode 5377. Number of steps to reduce binary representation to 1

5377. Number of steps to reduce binary representation to 1

Idea: First become an integer, and then calculate. C ++ will overflow if it becomes an integer, so use pyhton, // for division

class Solution:
    def numSteps(self, s: str) -> int:
        length = len(s)
        num = int(s,2)
        res = 0
        while num!=1:
            if num%2==1:
                num = num+1
            else:
                num = num//2
            res+=1
        return res;