class Solution:
def binaryGap(self, N):
"""
:type N: int
:rtype: int
"""
m = bin(N)[2:]
L = []
out = 0
for i in range(len(m)):
if m[i] == "1":
L.append(i)
if len(L) <= 1:
return 0
out = max([abs(L[j] - L[j+1]) for j in range(len(L)) if j < (len(L) -1)])
return out
思路:找到所有 “1”的索引 求其最大距离值