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):
# write your code in Python 3.6
return N
pass
[1]
[2147483647]
# 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
print(N)
pass
[1]
[2147483647]
example test n=1041=10000010001_2
tested program terminated with exit code 1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1041
Invalid result type, int expected, <class 'NoneType'> found.stdout:
15
Invalid result type, int expected, <class 'NoneType'> found.stdout:
32
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
2147483647
# 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
# 2진수 구하기
print(bin(N))
# 문자열 변환 후 binary gap 찾기
pass
[1]
[9]
[529]
[32]
[60]
[2147483647]
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
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b1001
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b1000010001
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b100000
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b111100
Invalid result type, int expected, <class 'NoneType'> found.stdout:
0b1111111111111111111111111111111
# 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
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
print(binNum[i])
pass
[1]
[9]
[529]
[32]
[60]
[2147483647]
example test n=1041=10000010001_2
tested program terminated with exit code 1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 0 0 0 0 0 1 0 0 0 1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 1 1 1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 0 0 0 0 0
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 0 0 1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 0 0 0 0 1 0 0 0 1
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 0 0 0 0 0
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 1 1 1 0 0
Invalid result type, int expected, <class 'NoneType'> found.stdout:
1 1 1 1 1 1 1 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
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i-1] == '1':
print(binNum[i])
pass
# 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
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i-1] == '1' && binNum[i] == '0':
print(binNum[i])
pass
# 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
binaryGap = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i-1] == '1' && binNum[i] == '0':
print(binNum[i])
pass
# 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
binaryGap = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[binNum[i] == '0':
print(binNum[i])
pass
# 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
binaryGap = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
elif binNum[i-1]
print(binNum[i])
pass
# 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
binaryGap = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
elif binNum[i-1] == '0':
print(binNum[i])
pass
# 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
binaryGap = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
print(binNum[i])
pass
# 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
binaryGap = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
print(binNum[i])
pass
# 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
binaryGap = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
print(binNum[i])
pass
# 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
binaryGap = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
print(binNum[i])
pass
# 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
binaryGap = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
print(binNum[i])
pass
# 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
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
print(binNum[i])
pass
# 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
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
if binar
print(binNum[i])
pass
# 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
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
if binaryGap > result:
result = binaryGap
print(binNum[i])
pass
# 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
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
if binaryGap > result:
result = binaryGap
print(binNum[i])
pass
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
if binaryGap > result:
result = binaryGap
print(binNum[i])
pass
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
if binaryGap > result:
result = binaryGap
print(binNum[i])
pass
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
if binaryGap > result:
result = binaryGap
binaryGap = 0
return result
pass
[1]
[9]
[529]
[32]
[60]
[2147483647]
function result: 0
function result: 2
function result: 4
function result: 0
function result: 0
function result: 0
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
if binaryGap > result:
result = binaryGap
binaryGap = 0
return result
pass
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
if binaryGap > result:
result = binaryGap
binaryGap = 0
return result
pass
[1]
[9]
[529]
[32]
[60]
[1041]
[2147483647]
function result: 0
function result: 2
function result: 4
function result: 0
function result: 0
function result: 5
function result: 0
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
if binaryGap > result:
result = binaryGap
binaryGap = 0
return result
pass
[1]
[9]
[529]
[32]
[60]
[1041]
[2147483647]
function result: 0
function result: 2
function result: 4
function result: 0
function result: 0
function result: 5
function result: 0
# print("this is a debug message")
def solution(N):
# write your code in Python 3.6
binaryGap = 0
result = 0
# 2진수 구하기
binNum = str(bin(N))
# 문자열 변환 후 binary gap 찾기
for i in range(2,len(binNum)):
if binNum[i] == '0':
if binNum[i-1] == '1':
binaryGap = 1
elif binNum[i-1] == '0':
binaryGap += 1
else:
if binaryGap > result:
result = binaryGap
binaryGap = 0
return result
pass
The solution obtained perfect score.