Number of Steps to Reduce a Number in Binary Representation to One LeetCode solution in Python

1
class Solution:
2
    def numSteps(self, s: str) -> int:
3
        size = len(s)
4
        if size == 1:
5
            return 0
6
        one_group = s.split("0")
7
        zero_group = s.split("1")
8

9
        if size - len(zero_group[-1]) == 1:
10
            return size - 1
11
        else:
12
            return size + len(one_group) - len(zero_group[-1])