给图书排序,分别按照 图书编号, 书名,价格,销量,评价排序

39 篇文章 0 订阅
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;

class authorComparator implements Comparator<Book> {

    @Override
    public int compare(Book o1, Book o2) {
        return o1.author.compareTo(o2.author);
    }
}
class nameComparator implements Comparator<Book> {

    @Override
    public int compare(Book o1, Book o2) {
        return o1.name.compareTo(o2.name);
    }
}
class pComparator implements Comparator<Book> {
    boolean asc;

    public pComparator(boolean asc) {
        this.asc = asc;
    }


    @Override
    public int compare(Book o1, Book o2) {
         {
            if (asc) {
                return o1.p - o2.p;
            } else {
                return o2.p - o1.p;
            }
        }
    }
}
class saleComparator implements Comparator<Book> {

    @Override
    public int compare(Book o1, Book o2) {
        return o1.sale-o2.sale;
    }
}
class commentComparator implements Comparator<Book> {

    @Override
    public int compare(Book o1, Book o2) {
        return o1.comment-o2.comment;
    }
}

public class Book implements Comparable<Book> {
    public String isbn;
    public String author;
    public String name;
    public int p;
    public int sale;
    public int comment;

    public Book(String isbn, String author, String name, int p, int sale, int comment) {
        this.isbn = isbn;
        this.author = author;
        this.name = name;
        this.p = p;
        this.sale = sale;
        this.comment = comment;
    }

    @Override
    public String toString() {
        return "Book{" +
                "isbn=" + isbn +
                ", author='" + author + '\'' +
                ", name='" + name + '\'' +
                ", p=" + p +
                ", sale=" + sale +
                ", comment=" + comment +
                '}';
    }

    @Override
    public int compareTo(Book o) {
        return isbn.compareTo(o.isbn);
    }
}


 class bookSort {

    public static void main(String[] args) {
        List<Book> a = new ArrayList<>();
        a.add(new Book("123456","小军","我和我的祖国",1,20,456));
        a.add(new Book("124456","小明","你",1,30,45));
        a.add(new Book("125456","小红","我们",1,80,457));
        a.add(new Book("126456","小峰","应物兄",1,50,452));
        a.add(new Book("127456","小蓝","我们三",1,60,458));
        a.add(new Book("128456","小紫","更狂日记",1,90,457));

        List<Book> copy;

        // 按自然顺序(ISBN)排序
        System.out.println("按 ISBN 排序:");
        copy = new ArrayList<>(a);
        sort(copy);
        System.out.println(copy);

        // 按书名排序
        System.out.println("按 书名 排序:");
        copy = new ArrayList<>(a);
        sort(copy, new nameComparator());
        System.out.println(copy);

        // 按价格排序-从小到大
        System.out.println("按 价格-从小到大 排序:");
        copy = new ArrayList<>(a);
        sort(copy, new pComparator(true));
        System.out.println(copy);

        // 按价格排序-从大到小
        System.out.println("按 价格-从大到小 排序:");
        copy = new ArrayList<>(a);
        sort(copy, new pComparator(false));
        System.out.println(copy);

        System.out.println("按 销量 排序:");
        copy = new ArrayList<>(a);
        sort(copy,new saleComparator());
        System.out.println(copy);

        System.out.println("按 评价 排序:");
        copy = new ArrayList<>(a);
        sort(copy,new commentComparator());
        System.out.println(copy);


    }

    public static void sort(List<Book> books) {
        for (int i = 1; i < books.size(); i++) {
            Book k = books.get(i);
            int j = i - 1;
            for (; j >= 0 && (books.get(j).compareTo(k)) > 0; j--) {
                books.set(j + 1, books.get(j));
            }
            books.set(j + 1, k);

        }    //使用直接插入法排序 

    }

    public static void sort(List<Book> books, Comparator<Book> cmp) {
        for (int i = 1; i < books.size(); i++) {
            Book k = books.get(i);
            int j = i - 1;
            for (; j >= 0 && cmp.compare(books.get(j), k) > 0; j--) {
                books.set(j + 1, books.get(j));
            }
            books.set(j + 1, k);

        }
    }
}

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值