Advanced Python list comprehension

问题:

Given two lists:

chars = ['ab', 'bc', 'ca']
words = ['abc', 'bca', 'dac', 'dbc', 'cba']

how can you use list comprehensions to generate a filtered list of words by the following condition: given that each word is of length n and chars is of length n as well, the filtered list should include only words that each i-th character is in the i-th string in words.

In this case, we should get ['abc', 'bca'] as a result.

(If this looks familiar to anyone, this was one of the questions in the previous Google code jam)

回答1:

[w for w in words if all([w[i] in chars[i] for i in range(len(w))])]

回答2:

>>> [word for word in words if all(l in chars[i] for i, l in enumerate(word))]
['abc', 'bca']

回答3:

Using zip:

[w for w in words if all([a in c for a, c in zip(w, chars)])]

or using enumerate:

[w for w in words if not [w for i, c in enumerate(chars) if w[i] not in c]]

回答4:

This works, using index:

[words[chars.index(char)] for char in chars if char in words[chars.index(char)]]

Am I missing something?

回答5:

A more simple approach:

yourlist = [ w for w in words for ch in chars if w.startswith(ch) ]

回答6:

Why so complex? This works as well:

[words[x] for x in range(len(chars)) if chars[x] in words[x]]