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")
# -*- coding:utf-8 -*-
# &Author AnFany
# Lesson 1:Iterations
# P 1.1 BinaryGap
def decimal_to_binary(N):
"""
将十进制的正整数转为二进制表示
:param N: 十进制的正整数
:return: 二进制表示的字符串
"""
binary = ''
while N != 0:
binary += str(N % 2)
N = int(N / 2)
return binary[::-1]
def solution(N):
"""
在整数的二进制表示中查找最长的零序列
:param N:1至2,147,483,647的整数
:return: 最长的零序列的长度
"""
binary_list = list(decimal_to_binary(N))
if '0' not in binary_list:
return 0
elif binary_list.count('1') == 1:
return 0
else:
first_1 = 0 # 前面1的位置
max_length = 0 # 间隔长度
for index, value in enumerate(binary_list):
if value == '1':
max_length = max(max_length, index-first_1-1)
first_1 = index
return max_length
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# -*- coding:utf-8 -*-
# &Author AnFany
# Lesson 1:Iterations
# P 1.1 BinaryGap
def decimal_to_binary(N):
"""
将十进制的正整数转为二进制表示
:param N: 十进制的正整数
:return: 二进制表示的字符串
"""
binary = ''
while N != 0:
binary += str(N % 2)
N = int(N / 2)
return binary[::-1]
def solution(N):
"""
在整数的二进制表示中查找最长的零序列
:param N:1至2,147,483,647的整数
:return: 最长的零序列的长度
"""
binary_list = list(decimal_to_binary(N))
if '0' not in binary_list:
return 0
elif binary_list.count('1') == 1:
return 0
else:
first_1 = 0 # 前面1的位置
max_length = 0 # 间隔长度
for index, value in enumerate(binary_list):
if value == '1':
max_length = max(max_length, index-first_1-1)
first_1 = index
return max_length
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
# -*- coding:utf-8 -*-
# &Author AnFany
# Lesson 1:Iterations
# P 1.1 BinaryGap
def decimal_to_binary(N):
"""
将十进制的正整数转为二进制表示
:param N: 十进制的正整数
:return: 二进制表示的字符串
"""
binary = ''
while N != 0:
binary += str(N % 2)
N = int(N / 2)
return binary[::-1]
def solution(N):
"""
在整数的二进制表示中查找最长的零序列
:param N:1至2,147,483,647的整数
:return: 最长的零序列的长度
"""
binary_list = list(decimal_to_binary(N))
if '0' not in binary_list:
return 0
elif binary_list.count('1') == 1:
return 0
else:
first_1 = 0 # 前面1的位置
max_length = 0 # 间隔长度
for index, value in enumerate(binary_list):
if value == '1':
max_length = max(max_length, index-first_1-1)
first_1 = index
return max_length
The solution obtained perfect score.