如果有两个格式不一样的 list, 怎么样判断是否含有“相同的单词”呢? - V2EX
V2EX = way to explore
V2EX 是一个关于分享和探索的地方
现在注册
已注册用户请  登录
推荐学习书目
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
meteor2013
V2EX    Python

如果有两个格式不一样的 list, 怎么样判断是否含有“相同的单词”呢?

  •  
  •   meteor2013 2015-01-15 07:34:16 +08:00 3401 次点击
    这是一个创建于 4002 天前的主题,其中的信息可能已经有所发展或是发生改变。
    第一个: [['Vodka'], ['Whisky'], ['Scotch'], ['Brandy']]
    第二个: (['Vodka', 'today', 'nice', 'drink', 'Scotch'], 'Group 2')
    11 条回复    2015-01-16 02:51:17 +08:00
    aheadlead
        1
    aheadlead  
       2015-01-15 07:44:43 +08:00
    列表解析为set...交给set处理吧...
    icedx
        2
    icedx  
       2015-01-15 07:46:52 +08:00 via Android
    for I in l1:
    ~for j in l2:
    Fox4y
        3
    Fox4y  
       2015-01-15 08:29:44 +08:00
    a=[['Vodka'], ['Whisky'], ['Scotch'], ['Brandy']]
    >>> for line in a:
    ... "Vodka" in line
    ztcontrol
        4
    ztcontrol  
       2015-01-15 09:09:36 +08:00
    外行, 写的不对请指正
    l1 = [['Vodka'], ['Whisky'], ['Scotch'], ['Brandy']]
    l2 = (['Vodka', 'today', 'nice', 'drink', 'Scotch'], 'Group 2')

    s1 = set()
    s2 = set()

    def listToSet(setx, listx):
    for listobj in listx:
    if type(listobj) == list:
    listToSet(setx, listobj)
    else:
    setx.add(listobj)

    listToSet(s1, l1)
    listToSet(s2, l2)
    print s1
    print s2
    print '/n'
    print s1 & s2
    thinkmore
        5
    thinkmore  
       2015-01-15 09:39:20 +08:00
    遍历
    scenix
        6
    scenix  
       2015-01-15 12:08:50 +08:00
    递归试试?

    #!/bin/env python
    #encoding=utf-8
    # Author: Aaron Shao - [email protected]
    # Last modified: 2015-01-15 12:07
    # Filename: test.py
    # Description:

    a= [['Vodka'], ['Whisky'], ['Scotch'], ['Brandy']]
    b = (['Vodka', 'today', 'nice', 'drink', 'Scotch'], 'Group 2')

    def parse(x):
    if isinstance(x, (tuple,list)):
    result = set([])
    for i in x:
    pass
    result = result | parse(i)
    return result
    elif isinstance(x, str):
    return set([x])
    else:
    return set([])

    x = parse(a)
    y = parse(b)

    print x & y
    scenix
        7
    scenix  
       2015-01-15 12:09:15 +08:00
    妈蛋 忘了把email删了。。。
    iannil
        8
    iannil  
       2015-01-15 12:14:05 +08:00
    1、看list1到list2的难度有多大。
    2、如果去掉无效元素难度不大,就直接先把list1都处理成list2,或把list1和list2都处理成list3的格式。
    3、如果去掉无效元素难度过大,就反过来处理,把list1和list2中你需要的信息拿出来,而不是去掉没用的信息。相同的单词这种特征简直太好取了。
    hahastudio
        9
    hahastudio  
       2015-01-15 12:54:13 +08:00   1
    这时候就要祭出一个经典的 recipe 啦:
    flatten arbitrarily nested lists
    https://stackoverflow.com/questions/10823877/what-is-the-fastest-way-to-flatten-arbitrarily-nested-lists-in-python

    交集就是
    set(flatten(l1)).intersection(set(flatten(l2)))
    imn1
        10
    imn1  
       2015-01-15 13:07:27 +08:00
    二维表一向都交由 pandas/numpy 处理,相关函数多得是

    虽然处理这个问题用 pandas 有点托大,但估计这种数据的产生和后续处理也有不少地方可以用到 pandas
    meteor2013
        11
    meteor2013  
    OP
       2015-01-16 02:51:17 +08:00
    @hahastudio 谢谢啊,你这个方法超赞!!
    关于     帮助文档     自助推广系统     博客     API     FAQ     Solana     962 人在线   最高记录 6679       Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 36ms UTC 22:38 PVG 06:38 LAX 14:38 JFK 17:38
    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