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:
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:
0b10000010001
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b1111
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b100000
0b10000010001
0b1111
0b100000
0b10000010001
0b1111
0b100000
0b10000010001 @@@
0b1111 @@@
0b100000 @@@
0b10000010001 b10000010001
0b1111 b1111
0b100000 b100000
10000010001
1111
100000
1 0 0 0 0 0 1 0 0 0 1
1 1 1 1
1 0 0 0 0 0
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count = []
binary_n = bin(N)[2:]
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
# 0을 만나고있으면 없음.
if start == False:
continue
else:
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count = []
binary_n = bin(N)[2:]
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
# 0을 만나고있으면 없음.
if start == False:
continue
else:
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
# 0을 만나고있으면 없음.
if start == False:
continue
else:
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
# 0을 만나고있으면 없음.
if start == False:
continue
else:
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
# 0을 만나고있으면 없음.
if start == False:
continue
else:
if c == '0':
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
# 0을 만나고있으면 없음.
if start == False:
continue
else:
if c == '0':
count
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
# 0을 만나고있으면 없음.
if start == False:
continue
else:
if c == '0':
zero_count += 1
else
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
# 0을 만나고있으면 없음.
if start == False:
continue
else:
if c == '0':
zero_count += 1
else:
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
# 0을 만나고있으면 없음.
if start == False:
continue
else:
if c == '0':
zero_count += 1
else:
zero_count_arr.append(zero_count)
zero_count = 0
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
# 0을 만나고있으면 없음.
if start == False:
continue
else:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고
else:
zero_count_arr.append(zero_count)
zero_count = 0
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
continue
# 0을 만나고있으면 없음.
if start == False:
continue
else:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고
else:
zero_count_arr.append(zero_count)
zero_count = 0
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
continue
# 0을 만나고있으면 없음.
if start == False:
continue
else:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고 초기
else:
zero_count_arr.append(zero_count)
zero_count = 0
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
start = False
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 1이 나오면 시작
if c == '1':
start = True
continue
# 0을 만나고있으면 없음.
if start == False:
continue
else:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고 초기화
else:
zero_count_arr.append(zero_count)
zero_count = 0
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
zero_count_arr = []
binary_n = bin(N)[2:]
zero_count = 0
for c in binary_n:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고 초기화
else:
zero_count_arr.append(zero_count)
zero_count = 0
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
zero_count_arr = []
binary_n = bin(N)[3:]
zero_count = 0
for c in binary_n:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고 초기화
else:
zero_count_arr.append(zero_count)
zero_count = 0
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
zero_count_arr = []
binary_n = bin(N)[3:]
zero_count = 0
for c in binary_n:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고 초기화
else:
zero_count_arr.append(zero_count)
zero_count = 0
if len(zero_count_arr) == 0
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
zero_count_arr = []
binary_n = bin(N)[3:]
zero_count = 0
for c in binary_n:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고 초기화
else:
zero_count_arr.append(zero_count)
zero_count = 0
if len(zero_count_arr) == 0:
return 0
else:
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
zero_count_arr = []
binary_n = bin(N)[3:]
zero_count = 0
for c in binary_n:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고 초기화
else:
zero_count_arr.append(zero_count)
zero_count = 0
if len(zero_count_arr) == 0:
return 0
else:
return max(zero_count_arr)
return N
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
zero_count_arr = []
binary_n = bin(N)[3:]
zero_count = 0
for c in binary_n:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고 초기화
else:
zero_count_arr.append(zero_count)
zero_count = 0
if len(zero_count_arr) == 0:
return 0
else:
return max(zero_count_arr)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
zero_count_arr = []
binary_n = bin(N)[3:]
zero_count = 0
for c in binary_n:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고 초기화
else:
zero_count_arr.append(zero_count)
zero_count = 0
if len(zero_count_arr) == 0:
return 0
else:
return max(zero_count_arr)
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(N):
zero_count_arr = []
binary_n = bin(N)[3:]
zero_count = 0
for c in binary_n:
# 0을 만나면 카운트 올림
if c == '0':
zero_count += 1
# 1이 나오면 결과를 집어넣고 초기화
else:
zero_count_arr.append(zero_count)
zero_count = 0
if len(zero_count_arr) == 0:
return 0
else:
return max(zero_count_arr)
The solution obtained perfect score.