在 Java 中删除数组中重复项的最佳方法是什么? [英] What is the best way to remove duplicates in an Array in Java?

问题描述

我有一个需要删除/过滤重复项的对象数组.我打算覆盖 equals &对象元素上的hachCode，然后将它们粘贴在一个集合中......但我认为我至少应该轮询stackoverflow，看看是否有其他方法，也许是其他API的一些聪明方法?

I have an Array of Objects that need the duplicates removed/filtered. I was going to just override equals & hachCode on the Object elements, and then stick them in a Set... but I figured I should at least poll stackoverflow to see if there was another way, perhaps some clever method of some other API?

推荐答案

我同意你的方法来覆盖 hashCode() 和 equals() 并使用实现Set.

I would agree with your approach to override hashCode() and equals() and use something that implements Set.

这样做还可以让任何其他开发人员清楚地知道非重复特征是必需的.

Doing so also makes it absolutely clear to any other developers that the non-duplicate characteristic is required.

另一个原因 - 您现在可以选择最能满足您需求的实现:

Another reason - you get to choose an implementation that meets your needs best now:

• HashSet
• TreeSet
• LinkedHashSet

而且您无需更改代码即可在未来更改实现.

and you don't have to change your code to change the implementation in the future.

这篇关于在 Java 中删除数组中重复项的最佳方法是什么?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！