package com.arrays_;
import java.util.Arrays;
import java.util.Comparator;
public class ArraysExercise {
public static void main(String[] args) {
Book[] books = new Book[4];
books[0] = new Book("红楼梦",100);
books[1] = new Book("金色的梅",90);
books[2] = new Book("青年文摘20年",5);
books[3] = new Book("java从入门到放弃~",300);
Arrays.sort(books, new Comparator() {
@Override
public int compare(Object o1, Object o2) {
Book book1 = (Book) o1;
Book book2 = (Book) o2;
double b1 = book1.getPrice();
double b2 = book2.getPrice();
if (b1>b2){
return -1;
}else if (b1<b2){
return 1;
}else {
return 0;
}
}
});
System.out.println("按照price 从大到小排序输出:");
System.out.println(Arrays.toString(books));
System.out.println("=========================");
Arrays.sort(books, new Comparator() {
@Override
public int compare(Object o1, Object o2) {
Book book1 = (Book) o1;
Book book2 = (Book) o2;
double b1 = book1.getPrice();
double b2 = book2.getPrice();
if (b1<b2){
return -1;
}else if (b1>b2){
return 1;
}else {
return 0;
}
}
});
System.out.println("按照price 从小到大排序输出:");
System.out.println(Arrays.toString(books));
System.out.println("=========================");
Arrays.sort(books, new Comparator() {
@Override
public int compare(Object o1, Object o2) {
Book book1 = (Book) o1;
Book book2 = (Book) o2;
return book2.getBook().length() - book1.getBook().length();
}
});
System.out.println("按照书名长度从大到小排序输出:");
System.out.println(Arrays.toString(books));
}
}
class Book{
private String name;
private double price;
public Book(String book, double price) {
this.name = book;
this.price = price;
}
public String getBook() {
return name;
}
public void setBook(String book) {
this.name = book;
}
public double getPrice() {
return price;
}
public void setPrice(double price) {
this.price = price;
}
@Override
public String toString() {
return "Book{" +
"book='" + name + '\'' +
", price=" + price +
'}';
}
}
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 使用C#创建一个MCP客户端
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型,支持深度思考和联网搜索!
· ollama系列1:轻松3步本地部署deepseek,普通电脑可用
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· 按钮权限的设计及实现