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].
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while True:
quotient, remainder = divmod(quotient)
if is_occur_one and remainder == 1:
max
pass
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while True:
quotient, remainder = divmod(quotient)
if is_occur_one and remainder == 1:
max_length =
pass
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while True:
quotient, remainder = divmod(quotient)
if is_occur_one and remainder == 1:
max_length = length if length > max_length else max_length
length = 0
pass
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while True:
quotient, remainder = divmod(quotient)
if is_occur_one and remainder == 1:
max_length = length if length > max_length else max_length
length = 0
pass
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while True:
quotient, remainder = divmod(quotient)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
pass
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while True:
quotient, remainder = divmod(quotient)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
else:
pass
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while True:
quotient, remainder = divmod(quotient)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
else:
is_occur_one = True
pass
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while True:
quotient, remainder = divmod(quotient)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
else:
is_occur_one = True
pass
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while True:
quotient, remainder = divmod(quotient)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
else:
is_occur_one = True
return length
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while quotient > 0:
quotient, remainder = divmod(quotient)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
else:
is_occur_one = True
return length
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while quotient > 0:
quotient, remainder = divmod(quotient)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
else:
is_occur_one = True
return max_length
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 12, in solution quotient, remainder = divmod(quotient) TypeError: divmod expected 2 arguments, got 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 12, in solution quotient, remainder = divmod(quotient) TypeError: divmod expected 2 arguments, got 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 12, in solution quotient, remainder = divmod(quotient) TypeError: divmod expected 2 arguments, got 1
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while quotient > 0:
quotient, remainder = divmod(quotient, 2)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
else:
is_occur_one = True
return max_length
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while quotient > 0:
quotient, remainder = divmod(quotient, 2)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
elif :
is_occur_one = True
return max_length
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while quotient > 0:
quotient, remainder = divmod(quotient, 2)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
elif not is_occur_one:
is_occur_one = True
return max_length
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while quotient > 0:
quotient, remainder = divmod(quotient, 2)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
elif no:
is_occur_one = True
return max_length
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while quotient > 0:
quotient, remainder = divmod(quotient, 2)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
elif remainder == 1:
is_occur_one = True
return max_length
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while quotient > 0:
quotient, remainder = divmod(quotient, 2)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
elif remainder == 1:
is_occur_one = True
return max_length
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
max_length = 0
length = 0
quotient = N
remainder = 0
is_occur_one = False
while quotient > 0:
quotient, remainder = divmod(quotient, 2)
if is_occur_one:
if remainder == 1:
max_length = length if length > max_length else max_length
length = 0
else:
length += 1
elif remainder == 1:
is_occur_one = True
return max_length
The solution obtained perfect score.