练习——集合排序

package com.collection_.list_;

public class Book {
    private String name;
    private String auther;
    private double price;

    public Book(String name, String auther, double price) {
        this.name = name;
        this.auther = auther;
        this.price = price;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public String getAuther() {
        return auther;
    }

    public void setAuther(String auther) {
        this.auther = auther;
    }

    public double getPrice() {
        return price;
    }

    public void setPrice(double price) {
        this.price = price;
    }

    @Override
    public String toString() {
        return "名称:" + name + "\t" + "价格:" + price + "\t" + "作者:" + auther + "\n";
    }
}

package com.collection_.list_;

import java.util.ArrayList;
import java.util.List;

public class ListExercise {
    @SuppressWarnings("all")
    public static void main(String[] args) {

        List list = new ArrayList();
        //List list = new Vector();
        //List list = new LinkedList();
        list.add(new Book("红楼梦","曹雪芹",100));
        list.add(new Book("西游记","吴承恩",10));
        list.add(new Book("水浒传","施耐庵",9));
        list.add(new Book("三国","罗贯中",80));
        list.add(new Book("西游记","吴承恩",90));

        //遍历
        for (Object o :list) {
            System.out.println(o);
        }

        //冒泡排序
        System.out.println("===排序后结果===");
        sort(list);

        for (Object o : list) {
            System.out.println(o);
        }

    }

    //价格要求从小到大
    public static void sort(List list){

        int listsize = list.size();
        for (int i = 0; i < listsize-1; i++) {
            for (int j = 0; j < listsize-1-i; j++) {
                //取出对象Book
                    Book book1 = (Book) list.get(j);
                    Book book2 = (Book) list.get(j+1);
                    if (book1.getPrice() > book2.getPrice()){   //交换
                        list.set(j,book2);
                        list.set(j+1,book1);
                    }
            }
        }
    }
}
posted @   Q1uuuu  阅读(29)  评论(0编辑  收藏  举报
相关博文:
阅读排行:
· 使用C#创建一个MCP客户端
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型,支持深度思考和联网搜索!
· ollama系列1:轻松3步本地部署deepseek,普通电脑可用
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· 按钮权限的设计及实现
点击右上角即可分享
微信分享提示