A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N.
For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001 and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation 10100 and contains one binary gap of length 1. The number 15 has binary representation 1111 and has no binary gaps. The number 32 has binary representation 100000 and has no binary gaps.
Write a function:
def solution(N)
that, given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn't contain a binary gap.
For example, given N = 1041 the function should return 5, because N has binary representation 10000010001 and so its longest binary gap is of length 5. Given N = 32 the function should return 0, because N has binary representation '100000' and thus no binary gaps.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..2,147,483,647].
example test n=1041=10000010001_2
tested program terminated with exit code 1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b10000010001
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b1111
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b100000
example test n=1041=10000010001_2
tested program terminated with exit code 1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
10000010001
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1111
Invalid result type, int expected, <class 'NoneType'> found.stdout:
100000
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = bN.find('1')
end_idx = bN.find('1', start_idx)
ret.append((start_idx))
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = int(bN.find('1'))
end_idx = int(bN.find('1', start_idx)
ret.append(start_idx)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = bN.find('1')
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
while bN.find('1',)
start_idx = bN.find('1')
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
while bN.find('1',)
start_idx = bN.find('1')
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
while i
start_idx = bN.find('1')
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
while i != -1:
start_idx = bN.find('1')
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
i = bN.find
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
end_idx = 0
while i != -1:
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
end_idx = 0
while end_idx is not -1:
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
end_idx = 0
while end_idx is not -1:
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
return ret.
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
end_idx = 0
while end_idx is not -1:
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
end_idx = 0
while end_idx is not -1:
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
end_idx = 0
while end_idx -1:
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
end_idx = 0
while end_idx != -1:
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
end_idx = 0
while end_idx != -1:
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
end_idx = 0
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
if
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
end_idx = 0
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
st = 0
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = 0
start_idx = bN.find('1', end_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = 0
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if cntbN.count('1') <= 1:
return 0
start_idx = 0
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if (cnt = bN.count('1')) <= 1:
return 0
while cnt
start_idx = 0
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if (cnt = bN.count('1')) <= 1:
return 0
start_idx = 0
while cnt:
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
cnt = cnt - 2
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if (cnt = bN.count('1')) <= 1:
return 0
start_idx = 0
while cnt > :
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
cnt = cnt - 2
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if (cnt = bN.count('1')) <= 1:
return 0
start_idx = 0
while :
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
cnt = cnt - 2
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if (cnt = bN.count('1')) <= 1:
return 0
start_idx = 0
while start_idx < bN.rfind('1:
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
cnt = cnt - 2
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = 0
while start_idx < bN.rfind('1'):
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = 0
while start_idx < bN.rfind('1'):
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
print
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = 0
while start_idx < bN.rfind('1'):
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
print(ret)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = 0
while start_idx < bN.rfind('1'):
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
print(ret)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = 0
while start_idx < bN.rfind('1'):
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
print(ret)
return max(ret)
example test n=1041=10000010001_2
tested program terminated with exit code 1
Traceback (most recent call last): File "exec.py", line 123, in <module> main() File "exec.py", line 85, in main result = solution( N ) File "/tmp/solution.py", line 15, in solution print(ret) OSError: [Errno 27] File too largestdout:
[-1] [-1, -1] [-1, -1, -1] [-1, -1, -1, -1] [-1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1,
Traceback (most recent call last): File "exec.py", line 123, in <module> main() File "exec.py", line 85, in main result = solution( N ) File "/tmp/solution.py", line 15, in solution print(ret) OSError: [Errno 27] File too largestdout:
[-1] [-1, -1] [-1, -1, -1] [-1, -1, -1, -1] [-1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] [-1, -1, -1, -1, -1, -1, -1, -1,
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = 0
while start_idx < bN.rfind('1'):
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
print(ret)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
start_idx = 0
while start_idx < bN.rfind('1'):
start_idx = bN.find('1', start_idx)
end_idx = bN.find('1', start_idx)
ret.append(end_idx - start_idx - 1)
print(ret)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
idx = -1
while True:
idx = bN.find('1', idx+1)
next_i = bN.find('1', idx+1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
idx = -1
while True:
idx = bN.find('1', idx+1)
next_i = bN.find('1', idx+1)
ret.append(next_i - idx)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
idx = -1
while True:
idx = bN.find('1', idx+1)
next_i = bN.find('1', idx+1)
ret.append(next_i - idx -1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
idx = -1
while True:
idx = bN.find('1', idx+1)
next_i = bN.find('1', idx+1)
if next_i == -1:
brea
ret.append(next_i - idx -1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
idx = -1
while True:
idx = bN.find('1', idx+1)
next_i = bN.find('1', idx+1)
if next_i == -1:
break
ret.append(next_i - idx -1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
idx = -1
while True:
idx = bN.find('1', idx+1)
next_i = bN.find('1', idx+1)
if next_i == -1:
break
ret.append(next_i - idx -1)
return max(ret)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
bN = str(format(N, '#b'))[2:]
ret = []
if bN.count('1') <= 1:
return 0
idx = -1
while True:
idx = bN.find('1', idx+1)
next_i = bN.find('1', idx+1)
if next_i == -1:
break
ret.append(next_i - idx -1)
return max(ret)
The solution obtained perfect score.