打印奇偶数交替的最长连续序列的长度

def print_alternating_sequence_length(nums):
    # 将奇偶数分别存储在两个列表中
    odd_nums = []
    even_nums = []
    for num in nums:
        if num % 2 == 0:
            even_nums.append(num)
        else:
            odd_nums.append(num)
    
    # 计算奇偶数序列的长度
    odd_length = calculate_longest_sequence(odd_nums)
    even_length = calculate_longest_sequence(even_nums)
    
    # 返回奇偶数序列长度的最大值
    return max(odd_length, even_length)

def calculate_longest_sequence(nums):
    if len(nums) == 0:
        return 0
    
    max_length = 1
    current_length = 1
    
    for i in range(1, len(nums)):
        # 如果当前数字与前一个数字的奇偶性相反，则长度加1
        if nums[i] % 2 != nums[i-1] % 2:
            current_length += 1
        else:
            # 如果当前数字与前一个数字的奇偶性相同，则重新计算长度
            current_length = 1
        
        # 更新最大长度
        max_length = max(max_length, current_length)
    
    return max_length

# 测试示例
nums = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]
result = print_alternating_sequence_length(nums)
print(result)