-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathiterations.py
More file actions
20 lines (18 loc) · 979 Bytes
/
iterations.py
File metadata and controls
20 lines (18 loc) · 979 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Iterations:
def BinaryGap(self, N):
"""
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 your code in Python 3.6
b = "{0:b}".format(N)
return 0 if b.count("1") <= 1 else len(max(b.strip("0").split("1")))
iteration = Iterations()
print(f"BinaryGap: {iteration.BinaryGap(6)}")