C++利用链表实现一个简单的图书信息管理系统,供大家参考,具体内容如下(1)图书信息包括ISBN号、书名、作者名、价格和数量等;(2)系统的主要功能包括:图书信息的创建。

#include <iostream>
using namespace std;
#define nullptr NULL

// 定义图书信息结构体
struct Book {
    string isbn;
    string title;
    string author;
    double price;
    int quantity;
    Book* next;
};

// 添加图书信息
void addBook(Book*& head, Book* newBook) {
    if (head == nullptr) {
        head = newBook;
    } else {
        Book* current = head;
        while (current->next != nullptr) {
            current = current->next;
        }
        current->next = newBook;
    }
}

// 输出图书信息
void displayBooks(Book* head) {
    if (head == nullptr) {
        cout << "图书信息为空" << endl;
    } else {
        Book* current = head;
        while (current != nullptr) {
            cout << "ISBN: " << current->isbn << endl;
            cout << "书名: " << current->title << endl;
            cout << "作者名: " << current->author << endl;
            cout << "价格: " << current->price << endl;
            cout << "数量: " << current->quantity << endl;
            cout << "=================" << endl;
            current = current->next;
        }
    }
}

// 查询图书信息
void searchBook(Book* head, string bookTitle) {
    if (head == nullptr) {
        cout << "图书信息为空" << endl;
    } else {
        Book* current = head;
        bool found = false;
        while (current != nullptr) {
            if (current->title == bookTitle) {
                cout << "ISBN: " << current->isbn << endl;
                cout << "书名: " << current->title << endl;
                cout << "作者名: " << current->author << endl;
                cout << "价格: " << current->price << endl;
                cout << "数量: " << current->quantity << endl;
                found = true;
            }
            current = current->next;
        }

        if (!found) {
            cout << "未找到该图书" << endl;
        }
    }
}

// 删除图书信息
void deleteBook(Book*& head, string bookTitle) {
    if (head == nullptr) {
        cout << "图书信息为空" << endl;
    } else {
        Book* current = head;
        Book* previous = nullptr;
        bool found = false;
        while (current != nullptr) {
            if (current->title == bookTitle) {
                if (previous == nullptr) {
                    head = current->next;
                } else {
                    previous->next = current->next;
                }
                delete current;
                found = true;
                cout << bookTitle << "已删除" << endl;
                break;
            }
            previous = current;
            current = current->next;
        }

        if (!found) {
            cout << "未找到该图书" << endl;
        }
    }
}

// 主函数
int main() {
    Book* head = nullptr;  // 头节点指针

    // 创建图书信息
    Book* book1 = new Book{"978-7-121-30918-5", "C++ Primer Plus", "Stephen Prata", 59.9, 10};
    Book* book2 = new Book{"978-7-111-56320-5", "C++ Primer", "Stanley B. Lippman", 69.9, 5};
    Book* book3 = new Book{"978-7-302-40865-1", "Effective Modern C++", "Scott Meyers", 89.9, 3};

    // 添加图书信息到链表
    addBook(head, book1);
    addBook(head, book2);
    addBook(head, book3);

    // 输出图书信息
    displayBooks(head);

    // 查询图书信息
    searchBook(head, "C++ Primer");

    // 删除图书信息
    deleteBook(head, "C++ Primer");

    // 再次输出图书信息
    displayBooks(head);

    // 释放内存
    Book* current = head;
    Book* next = nullptr;
    while (current != nullptr) {
        next = current->next;
        delete current;
        current = next;
    }

    return 0;
}

  • 13
    点赞
  • 7
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

YCY^v^

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值