TreeSet判断重复元素

Love The Way You Lie 2022-06-06 07:57 178阅读 0赞

TreeSet的底层是TreeMap的keySet()，而TreeMap是基于[红黑树][Link 1]实现的，红黑树是一种平衡二叉查找树，它能保证任何一个节点的左右子树的高度差不会超过较矮的那棵的一倍。

TreeMap是按key排序的，所以TreeSet中的元素也是排好序的。显然元素在插入TreeSet时compareTo()方法要被调用，所以TreeSet中的元素要实现Comparable接口。TreeSet作为一种Set，它不允许出现重复元素。TreeSet是用compareTo()来判断重复元素的，而非equals()，看下面代码。

import java.util.TreeSet;  
  
  
import org.junit.Test;  
  
  
public class TestTreeSet \{  
  
  
class Combine implements Comparable<Combine> \{  
private int p1;  
private int p2;  
  
  
public Combine(int p1, int p2) \{  
this.p1 = p1;  
this.p2 = p2;  
\}  
  
  
@Override  
public int hashCode() \{  
return p1 \* 31 + p2;  
\}  
  
  
@Override  
public boolean equals(Object obj) \{  
System.out.print("whether equal " + this + " and " + obj);  
boolean rect = false;  
if (obj instanceof Combine) \{  
System.out.println("whether equal " + this + " and " + obj);  
Combine other = (Combine) obj;  
rect = (this.p1 == other.getP1() && this.p2 == other.getP2());  
\}  
System.out.println(": " + rect);  
return rect;  
\}  
  
  
@Override  
public int compareTo(Combine o) \{  
System.out.print("compare " + this + " and " + o);  
// 排序时只考虑p1  
if (this.p1 < o.p1) \{  
System.out.println(", return -1");  
return -1;  
\} else if (this.p1 > o.p1) \{  
System.out.println(", return 1");  
return 1;  
\} else \{  
System.out.println(", return 0");  
return 0;  
\}  
\}  
  
  
@Override  
public String toString() \{  
return "(" + p1 + "," + p2 + ")";  
\}  
  
  
public int getP1() \{  
return p1;  
\}  
  
  
public void setP1(int p1) \{  
this.p1 = p1;  
\}  
  
  
public int getP2() \{  
return p2;  
\}  
  
  
public void setP2(int p2) \{  
this.p2 = p2;  
\}  
  
  
\}  
  
  
@Test  
public void test() \{  
Combine c1 = new Combine(1, 2);  
Combine c2 = new Combine(1, 2);  
Combine c3 = new Combine(1, 3);  
Combine c4 = new Combine(5, 2);  
  
  
TreeSet<Combine> set = new TreeSet<Combine>();  
set.add(c1);  
set.add(c2);  
set.add(c3);  
set.add(c4);  
while (!set.isEmpty()) \{ //按顺序输出TreeSet中的元素  
Combine combine = set.pollFirst();  
System.out.println(combine.getP1() + "\\t" + combine.getP2());  
\}  
\}  
\}

输出：

compare (1,2) and (1,2), return 0  
compare (1,2) and (1,2), return 0  
compare (1,3) and (1,2), return 0  
compare (5,2) and (1,2), return 1  
1 2  
5 2

我们看到不论compareTo()返回的是不是相等，equals()方法都没有被调用。

[转载地址][Link 2]

[Link 1]: http://www.cnblogs.com/zhangchaoyang/articles/2277591.html
[Link 2]: http://www.cnblogs.com/zhangchaoyang