日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

TreeSet集合排序方式二:定制排序Comparator

發布時間:2025/3/20 编程问答 36 豆豆
生活随笔 收集整理的這篇文章主要介紹了 TreeSet集合排序方式二:定制排序Comparator 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

Comparator有兩種實現方式:

1,匿名內部類
2,創建一個類用于實現Comparator,該類創建的對象就是比較器

Person類

public class Person implements Comparable<Person> {private String name;private String sex;private int age;private Book books;public String getName() {return name;}public void setName(String name) {this.name = name;}public String getSex() {return sex;}public void setSex(String sex) {this.sex = sex;}public int getAge() {return age;}public void setAge(int age) {this.age = age;}public Book getBooks() {return books;}public void setBooks(Book books) {this.books = books;}@Overridepublic String toString() {return "Person [name=" + name + ", sex=" + sex + ", age=" + age + ", books.name=" + books.getBookName() + ", books.price=" + books.getPrice() + "]";}public Person(String name, String sex, int age, Book books) {super();this.name = name;this.sex = sex;this.age = age;this.books = books;}public Person() {super();}}

Book類

package Homework3;public class Book {//Book類中 有 書名,書的價格private String bookName;private int price;public String getBookName() {return bookName;}public void setBookName(String bookName) {this.bookName = bookName;}public int getPrice() {return price;}public void setPrice(int price) {this.price = price;}@Overridepublic String toString() {return "Book [bookName=" + bookName + ", price=" + price + "]";}public Book(String bookName, int price) {super();this.bookName = bookName;this.price = price;}public Book() {super();}}

Comparator實現–匿名內部類

public class Test {public static void main(String[] args){//ComparatorTreeSet<Person> set2=new TreeSet<>(new Comparator<Person>() {@Overridepublic int compare(Person o1, Person o2) {if(o1.getAge()>o2.getAge()){return -1;}else if (o1.getAge()<o2.getAge()) {return 1;}else {CollationKey key=Collator.getInstance().getCollationKey(o1.getName());CollationKey key2=Collator.getInstance().getCollationKey(o2.getName());int n=key.compareTo(key2);if(n>0){return 1;}else if (n<0) {return -1;}else {int a=o1.getBooks().getPrice()-o2.getBooks().getPrice();if(a>0){return -1;}else if (a<0) {return 1;}else {CollationKey key3=Collator.getInstance().getCollationKey(o1.getBooks().getBookName());CollationKey key4=Collator.getInstance().getCollationKey(o2.getBooks().getBookName());int m=key3.compareTo(key4);if(m>0){return 1;}else if (m<0) {return -1;}else {return 0;}}}}}}); // 第一條件: 年齡 降序set2.add(new Person("Jane1", "female", 20, new Book("z指環王", 30)));set2.add(new Person("Jane2", "female", 30, new Book("z指環王", 30))); // 第二條件: 姓名升序set2.add(new Person("Ada3", "female", 30, new Book("z指環王", 30))); // 第三條件: 書的價格 降序set2.add(new Person("Ada4", "female", 30, new Book("z指環王", 50))); // 第四條件: 書名 升序set2.add(new Person("Ada5", "female", 30, new Book("m指環王", 50)));System.out.println(set2);} }

總結

以上是生活随笔為你收集整理的TreeSet集合排序方式二:定制排序Comparator的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。