将列表设置为嵌套列表，其中连续元素位于单独的列表中

我想将元素列表分成嵌套列表，每个子列表都有连续的元素。如果某个元素没有连续元素，则它应该位于单个列表中。

Input:

l1 = [1, 2, 3, 11, 12, 13, 23, 33, 34, 35, 45]
l2 = [11, 12, 13, 22, 23, 24, 33, 34]
l3 = [1, 2, 3, 11, 12, 13, 32, 33, 34, 45]

预期输出：

l1 = [[1, 2, 3], [11, 12, 13], [23], [33, 34, 35], [45]]
l2 = [[11, 12, 13], [22, 23, 24], [33, 34]]
l3 = [[1, 2, 3], [11, 12, 13], [32, 33, 34], [45]]

我已经尝试了下面的代码，但它没有给出预期的结果，打印了一个空列表：

def split_into_list(l):

    t = []
    for i in range(len(l) - 1):

        if abs(l[i] - l[i + 1]) == 0:
            t.append(l[i])

        elif abs(l[i] - l[i + 1]) != 0 and abs(l[i - 1] - l[i]) == 0:
            t.append(l[i])
            yield t
            split_into_list(l[i:])
        if i + 1 == len(l):
            t.append(l[i])
            yield t

l = [1, 2, 3, 11, 12, 13, 32, 33, 34, 45]
li = []
li.append(split_into_list(l))

for i in li:
    print(i, list(i))

定制更短的方法split_adjacent功能：

def split_adjacent(lst):
    res = [[lst[0]]]    # start/init with the 1st item/number
    for i in range(1, len(lst)):
        if lst[i] - res[-1][-1] > 1:  # compare current and previous item
            res.append([])
        res[-1].append(lst[i])
    return res


l1 = [1, 2, 3, 11, 12, 13, 23, 33, 34, 35, 45]
l2 = [11, 12, 13, 22, 23, 24, 33, 34]
l3 = [1, 2, 3, 11, 12, 13, 32, 33, 34, 45]

print(split_adjacent(l1))
print(split_adjacent(l2))
print(split_adjacent(l3))

最终输出：

[[1, 2, 3], [11, 12, 13], [23], [33, 34, 35], [45]]
[[11, 12, 13], [22, 23, 24], [33, 34]]
[[1, 2, 3], [11, 12, 13], [32, 33, 34], [45]]