计算熊猫序列中1的连续个数

def count_consecutive_ones(binary_string):
    max_consecutive_ones = 0
    current_consecutive_ones = 0

    for bit in binary_string:
        if bit == '1':
            current_consecutive_ones += 1
        else:
            max_consecutive_ones = max(max_consecutive_ones, current_consecutive_ones)
            current_consecutive_ones = 0

    max_consecutive_ones = max(max_consecutive_ones, current_consecutive_ones)

    return max_consecutive_ones