如何找到最小长度为3的所有可能的连续且不重叠的子列表

def find_sublists(lst):
    result = []
    for i in range(len(lst) - 2):
        sublist = lst[i:i+3]
        if not any(set(sublist) & set(sub) for sub in result):
            result.append(sublist)
    return result

# 示例用法
original_list = [1, 2, 3, 4, 5, 6, 7, 8, 9]
sublists = find_sublists(original_list)
print(sublists)

[[1, 2, 3], [4, 5, 6], [7, 8, 9]]