TreeSet

时间：2017-11-25 23:36:18 阅读：235 评论：0 收藏：0 [点我收藏+]

TreeSet是SortedSet接口实现的类. TreeSet保证了遍历时的有序性.TreeSet就是红黑树.

添加时,从根结点开始比较,确定插入左子树还是右子树,这是个比较的过程. 所以

(1) 添加的对象必须自身继承Comparable接口,实现compareTo(Object obj),比如基本数据类型的包装类,String类,Date类,Time类.

(2)CompareTo比较的原则可以自定义,自定义的叫定制排序,纯粹比较大小的叫自然排序.

 1 import java.util.*;
 2 public class TestJava {
 3     public static void main(String[] args) {
 4         OkHasComparable a1 = new OkHasComparable(2);
 5         OkHasComparable a2 = new OkHasComparable(1);
 6         OkHasComparable a3 = new OkHasComparable(3);
 7         OkHasComparable a4 = new OkHasComparable(3);
 8         
 9         TreeSet c = new TreeSet();
10         
11         c.add(a2); c.add(a1); c.add(a3); c.add(a4);
12         
13         Iterator it = c.iterator();
14         while(it.hasNext()) {
15             OkHasComparable ohc = (OkHasComparable)it.next();
16             System.out.println(ohc.i);
17         }
18         
19         System.out.print(c); System.out.println();
20         
21         System.out.println(c.first());
22         System.out.println(c.last());
23     }
24 }
25 
26 class ErrorNoComparable {
27     
28 }
29 /*
30 Interface ErrorNoCompareTo implements Comparable {
31     
32 }*/
33 
34 class OkHasComparable implements Comparable {
35     int i;
36     
37     public OkHasComparable(int i) {
38         this.i = i;
39     }
40     
41     public int compareTo(Object obj) {
42         
43             OkHasComparable ahc = (OkHasComparable)obj;
44             /*缺少检查类型检查模块,以后会写了再写*/
45           if(ahc.i == this.i) return 0;
46           else if(ahc.i < this.i) return this.i - ahc.i;
47           else return ahc.i - this.i;
48     }
49     public String toString() {
50         return this.i + "";
51     }
52 }