주어진 문자열의 이진 표현에서 가장 큰 연속 1의 길이를 찾는 Python 프로그램.

숫자가 주어지면 이진 표현에서 가장 긴 연속 1의 길이를 찾으십시오.

예시

Input: n = 15
Output: 4
The binary representation of 14 is 1111.

알고리즘

Step 1: input the number.
Step 2: use one counter variable c=0.
Step 3: Count the number of iterations to reach i = 0.
Step 4: This operation reduces length of every sequence of 1s by one.

예시 코드

# Python program to find
# length of the longest
# consecutive 1s in
# binary representation of a number.
def maxlength(n):
   # Initialize result
   c = 0
   # Count the number of iterations to
   # reach x = 0.
   while (n!=0):
      # This operation reduces length
      # of every sequence of 1s by one.
      n = (n & (n << 1))
      c=c+1
   return c
# Driver code
n=int(input("Enter The Number ::>"))
print("Maximum Length of 1's ::>",maxlength(n))

출력

Enter The Number ::>15
Maximum Length of 1's ::>4