学生通讯录的操作实现

可以实现添加,删除,查找,修改的功能。

#include <iostream>
#include <string>

using namespace std;

// 学生信息结构体
struct Student {
    string name;
    long long rollNumber;
    string phoneNumber;
    Student* next;
};

// 全局变量,指向学生链表的头节点
Student* head = nullptr;

// 函数声明
void addStudent();
void deleteStudent();
void searchStudent();
void modifyStudent();
void displayAllStudents();

int main() {
    int choice;

    while (true) {
        cout << "学生通讯录管理系统" << endl;
        cout << "1. 添加学生信息" << endl;
        cout << "2. 删除学生信息" << endl;
        cout << "3. 查找学生信息" << endl;
        cout << "4. 修改学生信息" << endl;
        cout << "5. 显示所有学生信息" << endl;
        cout << "6. 退出" << endl;
        cout << "请选择操作: ";
        cin >> choice;

        switch (choice) {
            case 1:
                addStudent();
                break;
            case 2:
                deleteStudent();
                break;
            case 3:
                searchStudent();
                break;
            case 4:
                modifyStudent();
                break;
            case 5:
                displayAllStudents();
                break;
            case 6:
                // 退出程序
                return 0;
            default:
                cout << "无效的选项,请重新选择。" << endl;
        }
    }

    return 0;
}

void addStudent() {
    Student* newStudent = new Student();
    cout << "请输入学生姓名: ";
    cin.ignore();
    getline(cin, newStudent->name);
    cout << "请输入学生学号: ";
    cin >> newStudent->rollNumber;
    cout << "请输入学生电话号码: ";
    cin.ignore();
    getline(cin, newStudent->phoneNumber);

    newStudent->next = head;
    head = newStudent;
    cout << "学生信息已添加。" << endl;
}

void deleteStudent() {
    int rollNumber;
    cout << "请输入要删除的学生学号: ";
    cin >> rollNumber;

    Student* current = head;
    Student* prev = nullptr;

    while (current != nullptr && current->rollNumber != rollNumber) {
        prev = current;
        current = current->next;
    }

    if (current == nullptr) {
        cout << "未找到学号为 " << rollNumber << " 的学生。" << endl;
        return;
    }

    if (prev == nullptr) {
        head = current->next;
    } else {
        prev->next = current->next;
    }

    delete current;
    cout << "学生信息已删除。" << endl;
}

void searchStudent() {
    int rollNumber;
    cout << "请输入要查找的学生学号: ";
    cin >> rollNumber;

    Student* current = head;

    while (current != nullptr) {
        if (current->rollNumber == rollNumber) {
            cout << "学生姓名: " << current->name << endl;
            cout << "学生电话号码: " << current->phoneNumber << endl;
            return;
        }
        current = current->next;
    }

    cout << "未找到学号为 " << rollNumber << " 的学生。" << endl;
}

void modifyStudent() {
    int rollNumber;
    cout << "请输入要修改信息的学生学号: ";
    cin >> rollNumber;

    Student* current = head;

    while (current != nullptr) {
        if (current->rollNumber == rollNumber) {
            cout << "请输入新的学生姓名: ";
            cin.ignore();
            getline(cin, current->name);
            cout << "请输入新的学生电话号码: ";
            getline(cin, current->phoneNumber);
            cout << "学生信息已修改。" << endl;
            return;
        }
        current = current->next;
    }

    cout << "未找到学号为 " << rollNumber << " 的学生。" << endl;
}

void displayAllStudents() {
    if (head == nullptr) {
        cout << "学生通讯录为空。" << endl;
        return;
    }

    Student* current = head;
    cout << "所有学生信息:" << endl;

    while (current != nullptr) {
        cout << "学生姓名: " << current->name << endl;
        cout << "学生学号: " << current->rollNumber << endl;
        cout << "学生电话号码: " << current->phoneNumber << endl;
        current = current->next;
    }
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值