TreeSet的总结

 

//TreeSet有两种顺序排列:自然顺序和自定义顺序

import java.util.TreeSet;

public class TreeSetTest

{

       public static void main(String[] args)

       {

              TreeSet set = new TreeSet();

              set.add("C");

              set.add("A");

              set.add("B");

              set.add("E");

              set.add("F");

              set.add("D");

              System.out.println(set);

       }

}

输出结果:[A, B, C, D, E, F]

//自定义TreeSet排序Compatator,以及用迭代遍历

import java.util.Comparator;

import java.util.Iterator;

import java.util.TreeSet;

 

public class TreeSetTest2

{

       public static void main(String[] args)

       {

              TreeSet set = new TreeSet(new PersonComparator());

              Person p1 = new Person(10);

              Person p2 = new Person(20);

              Person p3 = new Person(30);

              Person p4 = new Person(40);

              set.add(p1);

              set.add(p2);

              set.add(p3);

              set.add(p4);

              for(Iterator iter = set.iterator(); iter.hasNext();)

              {

                     Person p = (Person)iter.next();

                     System.out.println(p.score);

              }

       }

}

class Person

{

       int score;

       public Person(int score)

       {

              this.score = score;

       }

       public String toString()

       {

              return String.valueOf(this.score);

       }

}

class PersonComparator implements Comparator

{

       public int compare(Object arg0, Object arg1)

       {

              Person p1 = (Person) arg0;

              Person p2 = (Person) arg1;

              return p2.score - p1.score;

       }

}

//在compare方法中两个数值比较:如果小于则升序,等于则自然顺序,大于则降序

import java.util.Comparator;

import java.util.Iterator;

import java.util.TreeSet;

public class TreeSetTest3

{

       public static void main(String[] args)

       {

              TreeSet set = new TreeSet(new MyComparator());

              set.add("C");

              set.add("A");

              set.add("B");

              set.add("E");

              set.add("a");

              set.add("F");

              set.add("D");

              for(Iterator iter = set.iterator(); iter.hasNext();)

              {

                     String value = (String)iter.next();

                     System.out.println(value);           

              }

             

       }

}

class MyComparator implements Comparator

{

       public int compare(Object arg0, Object arg1)

       {

              String s1 = (String)arg0;

              String s2 = (String)arg1;

              return s2.compareTo(s1);

       }

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值