hackerrank Day 10: Binary Numbers-优快云博客

本文介绍了一个简单的C++程序，该程序用于找出给定十进制整数转换为二进制后的最大连续1的数量。通过迭代地右移位并检查最低位是否为1来计算连续1的数量，并更新最大连续1的计数。

Task
Given a base-10 $integer, n, convert it to binary (base-2). Then find and print the base-10 integer denoting the maximum number of consecutive 1's in n's binary representation.$

Input Format

A single integer, n $.$

Constraints

1 <= n <= 10^6

Output Format

Print a single base-10 $integer denoting the maximum number of consecutive 1's in the binary representation of n .$

Sample Input 1

Sample Output 1

Sample Input 2

Sample Output 2

Explanation

Sample Case 1:
The binary representation of 5 $is 101, so the maximum number of consecutive 1's is 1 .$

Sample Case 2:
The binary representation of $13 is 1101, so the maximum number of consecutive 1's is 2 .$

 1 #include <iostream>
 2 using namespace std;
 3 
 4 int main(){
 5     int n;
 6     cin >> n;
 7     int temp = n;
 8     int num = 0, max = 0;
 9     while(temp){
10         num = 0;
11         while(temp & 1){
12             num++;
13             temp >>= 1;
14         }
15         if(num > max)
16             max = num;
17         temp >>= 1;
18     }
19     cout << max << endl;
20     return 0;
21 }