This article shares the specific code for C++ linked list implementation address book design for your reference. The specific content is as follows
The functions are as follows:
1Add student information
2 Delete student information
3Display student information
4. Query student information
5 Student Information Sorting
6 Clear the screen information
7 Clear document information
8 Exit the management system
Upload the code!
#include <iostream>
#include <algorithm>
#include <string>
#include <fstream>//Read and write the header file of the fileusing namespace std;
struct ElementType;
struct Node;
struct Queue;
typedef struct Queue* MyQueue;
struct ElementType {
int id;
string name;
int num;
};
struct Node {
ElementType data;
Node* next;
};
struct Queue {
Node* front;
Node* rear;
};
MyQueue Init(MyQueue& q);//Initialize queue
bool IsEmpty(MyQueue q);//Determine if the queue is empty
bool Insert(ElementType x, MyQueue q);//Insert the data to the end of the queue
bool Delete(const int message, MyQueue q);//Find some data in the queue, and then delete the corresponding node
void Print(const Node* q);//Prints all the information in a node
void PrintAll(const MyQueue q);//Prints information from all nodes
bool FindByName(const string massage, const MyQueue q);//Prints information from all nodes
void Input(MyQueue q);//When the address book is empty, re-enter the information into the address book
void Write(MyQueue q);//Write the information from the queue to the document
MyQueue Read();//Write the information from the queue to the document
MyQueue ReadOrClear(MyQueue& q);//Whether to empty all the information
void Swap(ElementType& x, ElementType& y);//Swap functions in sort
MyQueue BubbleSort(MyQueue q);//Sort by student ID using bubble sort
void Menu(MyQueue q);//main menu
//Initialize the queueMyQueue Init(MyQueue& q) {
q = new Queue();
if (q == NULL) return NULL;
q->front = NULL;
q->rear = NULL;
return q;
}
// Check whether the queue is emptybool IsEmpty(MyQueue q) {
return q->front == NULL;
}
//Add informationbool Insert(ElementType x, MyQueue q) {
Node* temp = new Node();
if (temp == NULL) return false;
temp->data = x;//It is necessary to change it to the required content here. It is best to change it to a function form. The function is called when assigning, and the function is also called when printing. temp->next = NULL;
if (IsEmpty(q)) {
q->front = temp;
q->rear = temp;
return true;
}
else {
q->rear->next = temp;
q->rear = temp;
return true;
}
}
//Delete functionbool Delete(const int message, MyQueue q) {
Node* temp = new Node();
if (temp == NULL) return false;//Application for storage space failed bool pd = 0;
//First find this id and then delete it //First determine whether it is the head node. If you don't use the head node as the head node, then use it as the head node. if (q->front-> == message) {//If the header node is deleted temp = q->front;
q->front = q->front->next;
delete temp;
temp = NULL;
pd = 1;
}
else if (q->rear-> == message) {//If the tail node is deleted //First find the previous node of the tail node temp = q->front;
while (temp->next-> != message) temp = temp->next;
q->rear = temp;
q->rear->next = NULL;
pd = 1;
}
else {//If you delete the intermediate node temp = q->front;
while (temp->next != NULL && temp->next-> != message) temp = temp->next;
if (temp->next == NULL) return false;//Judge whether it is not found or not, return false Node* mp = new Node();
mp = temp->next;
temp->next = temp->next->next;
delete mp;
mp = NULL;
pd = 1;
}
if (pd == 1) {
Write(q);
cout << "This student information has been successfully deleted!" << endl;
return true;
}
}
//Search by namebool FindByName(const string massage, const MyQueue q) {//This function only has the search function, no printing function, the printing function is in another function Node* temp = new Node();
bool pd = 0;
if (q->front-> == massage) {
temp = q->front;
Print(temp);
return true;
}
else {
temp = q->front;
while (temp->next != NULL && temp->next-> != massage) temp = temp->next;
if (temp->next == NULL) return false;//The name of this person is not found, return false Print(temp->next);
return true;
}
}
//Print in singlevoid Print(const Node* q) {
cout << "The student's information is:" << endl;
cout << "Student number: " << q-> << " Name:" << q-> << " telephone number:" << q-> << endl;
}
//Print all student informationvoid PrintAll(const MyQueue q) {
cout << "Student Number";
for (int i = 0; i < 10; i++) {
cout << "-";
}
cout << "Name";
for (int i = 0; i < 10; i++) {
cout << "-";
}
cout << "telephone number" << endl;
Node* temp;
temp = q->front;
while (temp != NULL) {
cout << " " <<temp-> << " " << temp-> << " " << temp-> << endl;
temp = temp->next;
}
//cout << endl;
}
// Function function to implement sortingvoid Swap(ElementType& x, ElementType& y) {
ElementType temp;
temp = x;
x = y;
y = temp;
}
MyQueue BubbleSort(MyQueue q) {
if (q->front == NULL || q->front->next == NULL) return NULL;
for (Node* i = q->front; i->next != NULL; i = i->next) {
for (Node* j = q->front; j->next != NULL; j = j->next) {
if (j-> > j->next->) {
Swap(j->data, j->next->data);
}
}
}
return q;
}
//Save all the information into the documentvoid Write(MyQueue q) {
//Sort first according to the student number, and then store it q=BubbleSort(q);
ofstream writeIt;
("");
if (()) {
cout << "The file was not found!" << endl;
cout << "The program has been exited!" << endl;
exit(1);
}
Node* temp = new Node();
if (q!= NULL) {
temp= q->front;
while (temp != NULL) {
writeIt << temp-> << " " << temp-> << " " << temp-> << endl;;
temp = temp->next;
}
}
();
}
//Read all the information from the documentMyQueue Read() {
ifstream readIt("");
if (()) {
cout << "The file was not found!" << endl;
cout << "The program has been exited!" << endl;
exit(1);
}
int id1;
string name1;
int num1;
MyQueue q=new Queue();
ElementType x;
while (!()) {
readIt >> id1 >> name1 >> num1;
if (()) break;
= id1;
= name1;
= num1;
Insert(x, q);
}
();
return q;
}
//Read the information into the documentMyQueue ReadOrClear(MyQueue& q) {
q=Read();
return q;
}
//Empty the entire queuevoid MakeEmpty(MyQueue& q) {
while (q->front != NULL) {
Node* temp = new Node();
temp = q->front;
q->front = q->front->next;
delete temp;
}
}
// Main menuvoid Menu(MyQueue q) {
q=ReadOrClear(q);
while (1) {
cout << endl;
cout << "|----------------------------------------------------------------------------------------------------------------------------- << endl;
cout << "|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- << endl;
cout << "|----------------------------------------------------------------------------------------------------------------------------- << endl;
cout << "|----------------------------------------------------------------------------------------------------------------------------- << endl;
cout << "|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- << endl;
cout << "|----------------------------------------------------------------------------------------------------------------------------- << endl;
cout << "|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- << endl;
cout << "|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- << endl;
cout << "|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- << endl;
cout << "|-------------------------------------------------------|" << endl;
int n;
cout << "Enter your selection:" << endl;
cin >> n;
switch (n) {
case 1: {
ElementType x;
cout << "Please enter the information of this student: student number, name, phone number" << endl;
cin >> >> >> ;
Insert(x, q);
Write(q);
cout << "This student information has been successfully added!" << endl;
break;
}
case 2: {
cout << "Please enter the student number:" << endl;
int num1;
cin >> num1;
if (!Delete(num1, q)) {
cout << "The student does not exist in this system!" << endl;
};
break;
}
case 3: {
cout << "All student information is being printed...please wait!" << endl;
cout << "The information for all students is:" << endl;
PrintAll(q);
break;
}
case 4: {
cout << "Please enter the student's name:" << endl;
string name1;
cin >> name1;
if (!FindByName(name1, q)) {
cout << "The student does not exist in this system!" << endl;
}
break;
}
case 5: {
cout << "Sorting students by their student number..." << endl;
cout << "After sorting, the result is:" << endl;
BubbleSort(q);
PrintAll(q);
break;
}
case 6: {
system("cls");
break;
}
case 7: {
cout << "Please confirm in the third to confirm whether you want to clear all student information in the document! Please enter "yes" if you clear it, and if you don't clear it, please enter "no"." << endl;
string s;
cin >> s;
if (s == "yes") {
// First delete all nodes in the queue, and then write them to the document MakeEmpty(q);
q = Init(q);
Write(q);
cout << "All student information in the document has been successfully cleared!" << endl;
}
break;
}
case 8: {
cout << "Exit successfully!" << endl;
exit(0);
}
default:
cout << "The number of the option entered is incorrect, please re-enter!" << endl;
}
}
}
int main() {
MyQueue q;
q = Init(q);
Menu(q);
return 0;
}The above is all the content of this article. I hope it will be helpful to everyone's study and I hope everyone will support me more.