如果它们完全相同,包括项目的顺序,则从列表中删除重复的元组

Remove duplicate tuples from a list if they are exactly the same including order of items(如果它们完全相同,包括项目的顺序,则从列表中删除重复的元组)
本文介绍了如果它们完全相同,包括项目的顺序,则从列表中删除重复的元组的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着跟版网的小编来一起学习吧!

问题描述

我知道类似的问题已经在 Stack Overflow 上被问过很多次了,但我需要从列表中删除重复的元组,但不仅仅是它们的元素匹配,它们的元素必须按相同的顺序排列.换句话说,(4,3,5)(3,4,5) 都将出现在输出中,而如果两者都有 (3,3,5)(3,3,5),只有一个会在输出中.

I know questions similar to this have been asked many, many times on Stack Overflow, but I need to remove duplicate tuples from a list, but not just if their elements match up, their elements have to be in the same order. In other words, (4,3,5) and (3,4,5) would both be present in the output, while if there were both(3,3,5) and (3,3,5), only one would be in the output.

具体来说,我的代码是:

Specifically, my code is:

import itertools

x = [1,1,1,2,2,2,3,3,3,4,4,5]
y = []

for x in itertools.combinations(x,3):
    y.append(x)
print(y)

其中的输出很长.例如,在输出中,应该同时存在 (1,2,1)(1,1,2).但是应该只有一个(1,2,2).

of which the output is quite lengthy. For example, in the output, there should be both (1,2,1) and (1,1,2). But there should only be one (1,2,2).

推荐答案

set 会解决这个问题:

set will take care of that:

>>> a = [(1,2,2), (2,2,1), (1,2,2), (4,3,5), (3,3,5), (3,3,5), (3,4,5)]
>>> set(a)
set([(1, 2, 2), (2, 2, 1), (3, 4, 5), (3, 3, 5), (4, 3, 5)])
>>> list(set(a))
[(1, 2, 2), (2, 2, 1), (3, 4, 5), (3, 3, 5), (4, 3, 5)]
>>>

set 将仅删除 exact 个重复项.

set will remove only exact duplicates.

这篇关于如果它们完全相同,包括项目的顺序,则从列表中删除重复的元组的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持跟版网!

本站部分内容来源互联网,如果有图片或者内容侵犯您的权益请联系我们删除!

相关文档推荐

python: iterating through a dictionary with list values(python:遍历具有列表值的字典)
What is the difference between chain and chain.from_iterable in itertools?(itertools中chain和chain.from_iterable有什么区别?)
python JSON only get keys in first level(python JSON只获取第一级的键)
Iterate over n successive elements of list (with overlapping)(迭代列表的 n 个连续元素(重叠))
Loop problem while iterating through a list and removing recurring elements(遍历列表并删除重复元素时出现循环问题)
Elegant way to skip elements in an iterable(跳过可迭代元素的优雅方式)