與元組比較列出蟒蛇

Question

我有一個包含兩個詞

list = ["the","end"] 

我有一個元組列表清單，如本

bigramslist = [ ("the", "end"), ("end", "of"), ("of", "the"), ("the", "world") ] 

是否有可能系統性地去通過在每個元組bigramslist並查看列表中的兩個單詞是否與bigramlist中的任何元組匹配。如果是這樣，那麼返回true？爲了完整

感謝

Answer 1

>>> L1 = ["the","end"] 
>>> bigramslist = [ ("the","end"), ("end","of"), ("of","the"), ("the","world") ] 
>>> tuple(L1) in bigramslist 
True 

編輯：

>>> bigramsset = set([ ("the","end"), ("end","of"), ("of","the"), ("the","world") ]) 
>>> L1 = ["the","end"] 
>>> tuple(L1) in bigramsset 
True 

爲jsbueno指出，使用一組會導致O（1）搜索的時間複雜度，其中作爲搜索列表是O（ N）。作爲創建集合的附註也是一個附加的O（n）。

Answer 2

不知道這是否是你追求的：

>>> list = ["the", "end"] 
>>> bigramslist = [ ("the", "end"), ("end", "of"), ("of", "the"), ("the", "world") ] 
>>> def check(list, biglist): 
...  return [(list[0], list[1]) == big for big in biglist] 
... 
>>> check(list, bigramslist) 
[True, False, False, False] 
>>> 

匹配任何比較值的 - 那麼你可以決定做什麼如果列表中包含如此。

編輯：好吧，克里加的方法好多了。