题解 | #求最大连续bit数#

#include <iostream>
#include <string>
using namespace std;

int maxConsecutiveOnes(int n) {
    int maxCount = 0;
    int currentCount = 0;
    
    while (n > 0) {
        if (n & 1) {  // 当前位是1
            currentCount++;
            maxCount = max(maxCount, currentCount);
        } else {  // 当前位是0
            currentCount = 0;
        }
        n >>= 1;  // 右移一位
    }
    
    return maxCount;
}

int main() {
    int n;
    while (cin >> n) {
        cout << maxConsecutiveOnes(n) << endl;
    }
    return 0;
}

import java.util.Scanner;

public class Main {
    public static int maxConsecutiveOnes(int n) {
        int maxCount = 0;
        int currentCount = 0;
        
        while (n > 0) {
            if ((n & 1) == 1) {  // 当前位是1
                currentCount++;
                maxCount = Math.max(maxCount, currentCount);
            } else {  // 当前位是0
                currentCount = 0;
            }
            n >>= 1;  // 右移一位
        }
        
        return maxCount;
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int n = sc.nextInt();
            System.out.println(maxConsecutiveOnes(n));
        }
    }
}

def max_consecutive_ones(n: int) -> int:
    max_count = 0
    current_count = 0
    
    while n > 0:
        if n & 1:  # 当前位是1
            current_count += 1
            max_count = max(max_count, current_count)
        else:  # 当前位是0
            current_count = 0
        n >>= 1  # 右移一位
    
    return max_count

# 处理输入
while True:
    try:
        n = int(input())
        print(max_consecutive_ones(n))
    except EOFError:
        break