数组列表中数字的最长序列

def longest_sequence(nums):
    if not nums:
        return 0
    
    nums.sort()  # 对数组进行排序
    longest_len = 1  # 最长序列的长度
    current_len = 1  # 当前序列的长度
    start = 0  # 最长序列的起始位置
    
    for i in range(1, len(nums)):
        if nums[i] == nums[i-1] + 1:
            current_len += 1
        elif nums[i] != nums[i-1]:
            current_len = 1
        
        if current_len > longest_len:
            longest_len = current_len
            start = i - longest_len + 1
    
    return nums[start : start + longest_len]

# 示例用法
nums = [100, 4, 200, 1, 3, 2]
longest_seq = longest_sequence(nums)
print("最长序列:", longest_seq)
print("最长序列长度:", len(longest_seq))