简易图书管理系统

提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档


前言

刚入门的javaer,实现一个简单的图书管理系统,不涉及io,用到了面向对象,map,set容器,推荐作为新手入门,检验学习效果。

一、map,hashmap,set是什么?

请添加图片描述
一图胜千言

二、项目代码

1.测试代码

代码如下:

import java.util.*;

public class Test {
    public static void main(String[] args) {
        Map<Integer, Book> map = new HashMap<>();
        while (true) {
            System.out.println("1.show");
            System.out.println("2.add");
            System.out.println("3.delete");
            System.out.println("4.exit");

            Scanner sc = new Scanner(System.in);

            System.out.println("please entry");
            int choice = sc.nextInt();

            switch (choice) {
                case 1:
                    System.out.println("1.show");
                    Set<Integer> keySet = map.keySet();
                    for (Integer key : keySet) {
                        Book book = map.get(key);
                        System.out.println("number = " + book.getNumber() +
                                " | name = " + book.getName() +
                                " | author = " + book.getAuthor() +
                                " | price = " + book.getPrice());
                    }
                    break;
                case 2:
                    System.out.println("2.add");
                    System.out.println("name author number price");
                    String name = sc.next();
                    String author = sc.next();
                    int number = sc.nextInt();
                    int price = sc.nextInt();
                    map.put(number, new Book(name, author, number, price));
                    break;
                case 3:
                    System.out.println("3.delete");
                    System.out.println("enter the desire number to delete!");
                    int delNum = sc.nextInt();
                    Book book = new Book();
                    if ((book = map.remove(delNum)) == null) {
                        System.out.println("didn't exist this book");
                    } else {
                        System.out.println("number = " + book.getNumber() +
                                " | name = " + book.getName() +
                                " | author = " + book.getAuthor() +
                                " | price = " + book.getPrice());

                    }
                    break;
                case 4:
                    System.out.println("4.exit");
                    System.exit(-1);
                    break;
                default:
                    System.out.println("Wrong Operation");
                    break;
            }
        }
    }
}

2.Book类实现

代码如下:


public class Book {
    private String name;
    private String author;
    private int number;
    private int price;

    public Book() {
    }

    public Book(String name, String author, int number, int price) {
        this.name = name;
        this.author = author;
        this.number = number;
        this.price = price;
    }

    public String getName() {
        return name;
    }

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

    public String getAuthor() {
        return author;
    }

    public void setAuthor(String author) {
        this.author = author;
    }

    public int getNumber() {
        return number;
    }

    public void setNumber(int number) {
        this.number = number;
    }

    public int getPrice() {
        return price;
    }

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

总结

hashmap结构存储book,并将book的属性number作为map的键,number还可作为索引对map中的数据进行增删改查。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值