Is there a way to make a list comprehension in Python that only contains unique items?
My original idea was to use something like this : new_items = [unicode(item) for item in items]
However, I later realized that I needed to omit duplicate items. So I ended up with this ugly monstrosity :
unique_items = []
for item in items :
unicode_item = unicode(item)
if unicode_item not in unique_items :
unique_items.append(unicode_item)
Now this is far less pretty (and readable) than a simple list comprehension. So, is there a way to make a list comprehension equivalent to the above code?
Also order does matter, so I can't just use a set comprehension.
Well, there is no ordered set, but we can misuse OrderedDict:
from collections import OrderedDict
t = "never gonna give you up"
OrderedDict.fromkeys(t).keys()
Gives:
['n', 'e', 'v', 'r', ' ', 'g', 'o', 'a', 'i', 'y', 'u', 'p']
您的原始想法具有一定的理解力:
new_items = {unicode(item) for item in items}
I short one liner might be:
s = "some string"
unique_items = [unicode(ch) for ch in sorted(set(s), key=s.index)]
Make it a helper function, like so.
def unique_iter(iterable):
seen = set()
for item in iterable:
if item in seen:
continue
seen.add(item)
yield item
for ch in unique_iter("never gonna give you up"):
print ch,
outputs
nevrgoaiyup
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.