python - 根据彼此之间的差异对列表元素进行分组

Question

给定一个列表

A = [1, 6, 13, 15, 17, 18, 19, 21, 29, 36, 53, 58, 59, 61, 63, 78, 79, 81, 102, 114]

有没有一种简单的方法可以对连续元素之间的差异小于 3 的所有集群进行分组？

也就是说，获得类似的东西：

[13, 15, 17, 19, 21], [58, 59, 61, 63], [78, 79, 81]

我想知道是否存在任何内置函数，但我找不到类似的东西。我试图用 的 来解决groupby这个问题itertools，但我被卡住了。先感谢您。

Answer 1

您可以使用itertools.groupby：

import itertools
A = [1, 6, 13, 15, 17, 18, 19, 21, 29, 36, 53, 58, 59, 61, 63, 78, 79, 81, 102, 114]
new_a = [(A[i+1]-A[i], A[i]) for i in range(len(A)-1)]
a = [[a, [c for _, c in b]] for a, b in itertools.groupby(new_a, key=lambda x:x[0] < 3)]
final_groups = [a[i][-1]+[a[i+1][-1][0]] if a[i+1][-1][0] - a[i][-1][-1] < 3 else a[i][-1] for i in range(len(a)-1) if a[i][0]]

输出：

[[13, 15, 17, 18, 19, 21], [58, 59, 61, 63], [78, 79, 81]]

Answer 2

根据您的评论

重要的是“存储元素直到”条件满足

你可以用itertools.takewhile这个。

takewhile(predicate, iterable) --> takewhile 对象

只要谓词对每个条目的计算结果为真，就从可迭代对象中返回连续条目。

这个解决方案当然有改进的余地，但要点是使用takewhile

class Grouper:
    """simple class to perform comparison when called, storing last element given"""
    def __init__(self, diff):
        self.last = None
        self.diff = diff
    def predicate(self, item):
        if self.last is None:
            return True
        return abs(self.last - item) < self.diff
    def __call__(self, item):
        """called with each item by takewhile"""
        result = self.predicate(item)
        self.last = item
        return result


def group_by_difference(items, diff=3):
    results = []
    start = 0
    remaining_items = items
    while remaining_items:
        g = Grouper(diff)
        group = [*itertools.takewhile(g, remaining_items)]
        results.append(group)
        start += len(group)
        remaining_items = items[start:]
    return results

这为您提供了具有单例集群的分组项目。

[[1],
 [6],
 [13, 15, 17, 18, 19, 21],
 [29],
 [36],
 [53],
 [58, 59, 61, 63],
 [78, 79, 81],
 [102],
 [114]]

Answer 3

这是使用迭代的一种方法。

前任：

A = [1, 6, 13, 15, 17, 18, 19, 21, 29, 36, 53, 58, 59, 61, 63, 78, 79, 81, 102, 114]
res = []
temp = []
l = len(A)-1

for i,v in enumerate(A):
    if i+1 > l:
        break

    if abs(v - A[i+1]) < 3:
        temp.append(v)
    else:
        if temp:
            temp.append(v)
            res.append(temp)
            temp = []
print(res)

输出：

[[13, 15, 17, 18, 19, 21], [58, 59, 61, 63], [78, 79, 81]]

Answer 4

与要求运行相同数量的此答案类似，可以numpy.split在此处使用：

import numpy as np

def plateaus(A, atol=3):
    runs = np.split(A, np.where(np.abs(np.diff(A)) >= atol)[0] + 1)
    return [list(x) for x in runs if len(x) > 1]

A = [1, 6, 13, 15, 17, 18, 19, 21, 29, 36, 53, 58, 59, 61, 63, 78, 79, 81, 102, 114]
print(plateaus(A))
[[13, 15, 17, 18, 19, 21], [58, 59, 61, 63], [78, 79, 81]]

如果不过滤长度，这将为您提供单例集群，就像@sytech的itertools.takehwile方法一样。