分割列表 - V2EX
V2EX = way to explore
V2EX 是一个关于分享和探索的地方
Sign Up Now
For Existing Member  Sign In
推荐学习书目
Learn Python the Hard Way
Python Sites
PyPI - Python Package Index
http://diveintopython.org/toc/index.html
Pocoo
值得关注的项目
PyPy
Celery
Jinja2
Read the Docs
gevent
pyenv
virtualenv
Stackless Python
Beautiful Soup
结巴中文分词
Green Unicorn
Sentry
Shovel
Pyflakes
pytest
Python 编程
pep8 Checker
Styles
PEP 8
Google Python Style Guide
Code Style from The Hitchhiker's Guide
doer233

分割列表

  •  
  •   doer233 Dec 13, 2016 3596 views
    This topic created in 3423 days ago, the information mentioned may be changed or developed.
    有这样一个列表,里面只有两种元素 0,1 。例如[0,1,0,0,0,1,1,1,0,0,1],要将这个列表分割得到以下列表[[0],[1],[0,0,0],[1,1,1],[0,0],[1]]。就是将列表里面连续的元素放入一个个子列表里。不知道能不能用 lambda 列表推导式求出?
    16 replies    2016-12-13 17:43:01 +08:00
    wyntergreg
        1
    wyntergreg  
       Dec 13, 2016
    能。
    bazingaterry
        2
    bazingaterry  
       Dec 13, 2016 via iPhone
    reduce?
    Valyrian
        3
    Valyrian  
       Dec 13, 2016
    l = [0,1,0,0,0,1,1,1,0,0,1]
    l1 = [(l[i], i) for i in xrange(len(l)) if i == len(l) - 1 or l[i] != l[i+1]]
    l2 = [([l1[i][0]] * (l1[i][1] + 1 if i == 0 else l1[i][1] - l1[i-1][1])) for i in xrange(len(l1))]

    根本不值得这样写,可读性为 0 。。
    princelai
        4
    princelai  
       Dec 13, 2016
    l = [0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1]

    [[l[j]]*(i-j) for i,j in zip([i for i in range(len(l)) if l[i] != l[i-1]][1:] + [len(l)] , [i for i in range(len(l)) if l[i] != l[i-1]])]

    方法和楼上类似,不推荐这么做,写完我都晕了
    mgna17
        5
    mgna17  
       Dec 13, 2016   1
    l = [0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1]

    def func(x, y):
       try:
         if x[-1][-1] != y:
         x.append([y])
       else:
         x[-1].append(y)
       except IndexError:
         x.append([y])
       return x

    res = reduce(func, l, [])

    撸了个 reduce 版的
    mgna17
        6
    mgna17  
       Dec 13, 2016
    @mgna17

    缩进缩错了 - - ,改正

    l = [0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1]

    def func(x, y):
       try:
         if x[-1][-1] != y:
            x.append([y])
          else:
            x[-1].append(y)
       except IndexError:
         x.append([y])
       return x

    res = reduce(func, l, [])
    ericls
        7
    ericls  
       Dec 13, 2016
    @mgna17 你这个方法比上面的大概快 100%
    BBrother
        8
    BBrother  
       Dec 13, 2016
    @mgna17 怎么在回复里缩进的?
    mgna17
        9
    mgna17  
       Dec 13, 2016
    @BBrother

    我是复制到浏览器里手动打全角空格,所以我上面还打错了
    9hills
        10
    9hills  
       Dec 13, 2016
    不要为了追求技巧。。就简简单单的 for 循环能搞定的事情。。。
    a=[0,1,0,0,0,1,1,1,0,0,1]
    b=[]
    for i in a:
    __if b and b[-1][0] == i:
    ____b[-1].append(i)
    __else:
    ____b.append([i])

    可读性秒杀楼上方法
    SakuraSa
        11
    SakuraSa  
       Dec 13, 2016   8
    似乎内置的 groupby 函数可以做这件事:

    from itertools import groupby
    a = [0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1]
    b = [list(it) for key, it in groupby(a)]
    Magic347
        12
    Magic347  
       Dec 13, 2016
    def gen(l):
    assert len(l) > 0
    curr = l[0]
    cnt = 1
    for i in range(1, len(l)):
    if l[i] == curr:
    cnt += 1
    else:
    yield [curr] * cnt
    curr = l[i]
    cnt= 1
    yield [curr] * cnt

    得到 1 个生成器可供迭代
    Magic347
        13
    Magic347  
       Dec 13, 2016
    def gen(l):
       assert len(l) > 0
       curr = l[0]
       cnt = 1
       for i in range(1, len(l)):
         if l[i] == curr:
           cnt += 1
         else:
           yield [curr] * cnt
           curr = l[i]
           cnt = 1
       yield [curr] * cnt

    得到 1 个生成器可供迭代
    petelin
        14
    petelin  
       Dec 13, 2016 via Android
    practicer
        15
    practicer  
       Dec 13, 2016
    @SakuraSa 最佳
    ppa22222
        16
    ppa22222  
       Dec 13, 2016
    About     Help     Advertise     Blog     API     FAQ     Solana     4703 Online   Highest 6679       Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 55ms UTC 00:12 PVG 08:12 LAX 17:12 JFK 20:12
    Do have faith in what you're doing.
    ubao msn snddm index pchome yahoo rakuten mypaper meadowduck bidyahoo youbao zxmzxm asda bnvcg cvbfg dfscv mmhjk xxddc yybgb zznbn ccubao uaitu acv GXCV ET GDG YH FG BCVB FJFH CBRE CBC GDG ET54 WRWR RWER WREW WRWER RWER SDG EW SF DSFSF fbbs ubao fhd dfg ewr dg df ewwr ewwr et ruyut utut dfg fgd gdfgt etg dfgt dfgd ert4 gd fgg wr 235 wer3 we vsdf sdf gdf ert xcv sdf rwer hfd dfg cvb rwf afb dfh jgh bmn lgh rty gfds cxv xcv xcs vdas fdf fgd cv sdf tert sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf shasha9178 shasha9178 shasha9178 shasha9178 shasha9178 liflif2 liflif2 liflif2 liflif2 liflif2 liblib3 liblib3 liblib3 liblib3 liblib3 zhazha444 zhazha444 zhazha444 zhazha444 zhazha444 dende5 dende denden denden2 denden21 fenfen9 fenf619 fen619 fenfe9 fe619 sdf sdf sdf sdf sdf zhazh90 zhazh0 zhaa50 zha90 zh590 zho zhoz zhozh zhozho zhozho2 lislis lls95 lili95 lils5 liss9 sdf0ty987 sdft876 sdft9876 sdf09876 sd0t9876 sdf0ty98 sdf0976 sdf0ty986 sdf0ty96 sdf0t76 sdf0876 df0ty98 sf0t876 sd0ty76 sdy76 sdf76 sdf0t76 sdf0ty9 sdf0ty98 sdf0ty987 sdf0ty98 sdf6676 sdf876 sd876 sd876 sdf6 sdf6 sdf9876 sdf0t sdf06 sdf0ty9776 sdf0ty9776 sdf0ty76 sdf8876 sdf0t sd6 sdf06 s688876 sd688 sdf86