快速业务通道

Java:比较与排序 - 编程入门网

作者 佚名技术 来源 NET编程 浏览 发布时间 2012-06-18
{     return (age + "{" + name + "}");   } }

Java:比较与排序(2)

时间:2011-02-25 zhangjunhd

2.1 测试Arrays.sort()方法

ArraysSortUnit.java

package com.zj.sort.comparable; import java.util.Arrays; import com.zj.compare.Person; public class ArraysSortUnit {   public static void main(String[] args) {     Person[] ps = { new Person(20, "Tom"), new Person(20, "Jeff"),        new Person(30, "Mary"), new Person(20, "Ada"),        new Person(40, "Walton"), new Person(61, "Peter"),        new Person(20, "Bush") };     System.out.println(Arrays.toString(ps));     Arrays.sort(ps);     System.out.println(Arrays.toString(ps));   } }

结果:

[20{Tom}, 20{Jeff}, 30{Mary}, 20{Ada}, 40{Walton}, 61{Peter}, 20{Bush}] [20{Ada}, 20{Bush}, 20{Jeff}, 20{Tom}, 30{Mary}, 40{Walton}, 61{Peter}]

2.2 测试Collections.sort()方法

CollctionsSortUnit.java

package com.zj.sort.comparable; import java.util.Arrays; import java.util.Collections; import com.zj.compare.Person; public class CollctionsSortUnit {   public static void main(String[] args) {     Person[] ps = { new Person(20, "Tom"), new Person(20, "Jeff"),        new Person(30, "Mary"), new Person(20, "Ada"),         new Person(40, "Walton"), new Person(61, "Peter"),        new Person(20, "Bush") };     System.out.println(Arrays.toString(ps));     Collections.sort(Arrays.asList(ps));     System.out.println(Arrays.toString(ps));   } }

结果:

[20{Tom}, 20{Jeff}, 30{Mary}, 20{Ada}, 40{Walton}, 61{Peter}, 20{Bush}] [20{Ada}, 20{Bush}, 20{Jeff}, 20{Tom}, 30{Mary}, 40{Walton}, 61{Peter}]

2.3 测试TreeSet

TreeSetUnit.java

package com.zj.sort.comparable; import java.util.TreeSet; import com.zj.compare.Person; public class TreeSetUnit {   public static void main(String[] args) {     TreeSet<Person> set = new TreeSet<Person>();     set.add(new Person(20, "Tom"));     set.add(new Person(20, "Jeff"));     set.add(new Person(30, "Mary"));     set.add(new Person(20, "Ada"));     set.add(new Person(40, "Walton"));     set.add(new Person(61, "Peter"));     set.add(new Person(20, "Bush"));     System.out.println(set);   } }

结果:

[20{Ada}, 20{Bush}, 20{Jeff}, 20{Tom}, 30{Mary}, 40{Walton}, 61{Peter}]

Java:比较与排序(3)

时间:2011-02-25 zhangjunhd

2.4 测试TreeMap

TreeMapUnit.java

package com.zj.sort.comparable; import java.util.TreeMap; import com.zj.compare.Person; public class TreeMapUnit {   public static void main(String[] args) {     TreeMap<Person, String> map = new TreeMap<Person, String>();     map.put(new Person(20, "Tom"), "Tom");     map.put(new Person(20, "Jeff"), "Jeff");     map.put(new

凌众科技专业提供服务器租用、服务器托管、企业邮局、虚拟主机等服务,公司网站:http://www.lingzhong.cn 为了给广大客户了解更多的技术信息,本技术文章收集来源于网络,凌众科技尊重文章作者的版权,如果有涉及你的版权有必要删除你的文章,请和我们联系。以上信息与文章正文是不可分割的一部分,如果您要转载本文章,请保留以上信息,谢谢!

分享到: 更多

Copyright ©1999-2011 厦门凌众科技有限公司 厦门优通互联科技开发有限公司 All rights reserved

地址(ADD):厦门软件园二期望海路63号701E(东南融通旁) 邮编(ZIP):361008

电话:0592-5908028 传真:0592-5908039 咨询信箱:web@lingzhong.cn 咨询OICQ:173723134

《中华人民共和国增值电信业务经营许可证》闽B2-20100024  ICP备案:闽ICP备05037997号