查找最大长度的子列表会导致错误的结果

def find_longest_sublist(nums):
    start = 0
    end = 0
    max_length = 0
    max_start = 0
    
    while end < len(nums):
        # 检查窗口中的子列表是否满足条件
        if condition(nums[start:end+1]):
            # 更新最长子列表的长度和起始位置
            if end - start + 1 > max_length:
                max_length = end - start + 1
                max_start = start
            end += 1
        else:
            start += 1
    
    return nums[max_start:max_start+max_length]