栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

在列表中查找数量递增的组

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

在列表中查找数量递增的组

使用itertools和numpy的几种不同方式:

from itertools import groupby, tee, cyclex = [17, 17, 19, 20, 21, 22, 0, 1, 2, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 14, 14, 28, 29, 30, 31, 32, 33, 34, 35,     36, 1, 2, 3, 4,34,54]def sequences(l):    x2 = cycle(l)    next(x2)    grps = groupby(l, key=lambda j: j + 1 == next(x2))    for k, v in grps:        if k: yield tuple(v) + (next((next(grps)[1])),)print(list(sequences(x)))[(19, 20, 21, 22), (0, 1, 2), (4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14), (28, 29, 30, 31, 32, 33, 34, 35, 36), (1, 2, 3, 4)]

或者使用python3并从中产生:

def sequences(l):    x2 = cycle(l)    next(x2)    grps = groupby(l, key=lambda j: j + 1 == next(x2))    yield from (tuple(v) + (next((next(grps)[1])),) for k,v in grps if k)print(list(sequences(x)))

在这里使用我的答案的变化与numpy.split:

out = [tuple(arr) for arr in np.split(x, np.where(np.diff(x) != 1)[0] + 1) if arr.size > 1]print(out)[(19, 20, 21, 22), (0, 1, 2), (4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14), (28, 29, 30, 31, 32, 33, 34, 35, 36), (1, 2, 3, 4)]

类似于ekhumoro的回答:

def sequences(x):    it = iter(x)    prev, temp = next(it), []    while prev is not None:        start = next(it, None)        if prev + 1 == start: temp.append(prev)        elif temp: yield tuple(temp + [prev]) temp = []        prev = start

获取长度和元组:

def sequences(l):    x2 = cycle(l)    next(x2)    grps = groupby(l, key=lambda j: j + 1 == next(x2))    for k, v in grps:        if k: t = tuple(v) + (next(next(grps)[1]),) yield t, len(t)def sequences(l):    x2 = cycle(l)    next(x2)    grps = groupby(l, lambda j: j + 1 == next(x2))    yield from ((t, len(t)) for t in (tuple(v) + (next(next(grps)[1]),)     for k, v in grps if k))def sequences(x):        it = iter(x)        prev, temp = next(it), []        while prev is not None: start = next(it, None) if prev + 1 == start:     temp.append(prev) elif temp:     yield tuple(temp + [prev]), len(temp) + 1     temp = [] prev = start

这三个输出都将相同:

[((19, 20, 21, 22), 4), ((0, 1, 2), 3), ((4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14), 11), ((28, 29, 30, 31, 32, 33, 34, 35, 36), 9), ((1, 2, 3, 4), 4)]


转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/648324.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号