Binary Gap LeetCode solution in Python

1
class Solution:
2
    def binaryGap(self, n: int) -> int:
3
        prev = 0
4
        res = 0
5
        for i, d in enumerate(bin(n)[3:]):
6
            if d == "1":
7
                res = max(res, i - prev + 1)
8
                prev = i + 1
9
        return res