1. TreeSet對(duì)實(shí)現(xiàn)了Comparable接口的對(duì)象排序

import java.util.TreeSet;/*** TreeSet對(duì)實(shí)現(xiàn)了Comparable接口的對(duì)象排序 */ public class TreeSetComparable {public static void main(String[] args) {TreeSet<Person> ts = new TreeSet<Person>();ts.add(new Person("zhangsan", 19));ts.add(new Person("cuihua", 16));ts.add(new Person("fanbingbing", 39));ts.add(new Person("zhaoliying", 29));for (Person item : ts) {System.out.println(item);}} }class Person implements Comparable<Person>{public String name;public int age;public Person(String name, int age) {this.name = name;this.age = age;}public int compareTo(Person o) {return o.age - age;}public String toString() {return "[name = " + name + " age = " + age + "]";} }

?

總結(jié)

以上是生活随笔為你收集整理的009_TreeSet对实现了Comparable接口的对象排序的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。