链表实现队队列(初始化,创建,删除)
***备注:在调用函数时一定要注意函数的形参和main函数中的实参是赋值关系,如果在调用的函数中使用new或者是malloc函数开辟空间时要注意其地址给了哪个变量。如果调用函数传入的是指针,那么在生成空间后要将地址传给main的实参,别传给调用函数的形参。如果想直接控制main里的指针,最好还是使用二级指针进行调用函数传值,以保证能准确找到main实参的内存地址。
&&&直接上菜--------------------------->:
#include <stdio.h>
#include <iostream>
using namespace std;
struct queue_lnode {
int data;
queue_lnode* next;
};
struct queue_lr {
queue_lnode* rear;
queue_lnode* front;
};
queue_lr* init_queue() {
queue_lr* p;
p = new queue_lr;
p->front = new queue_lnode;
p->rear = p->front;
(p->front)->data = 0;
return p;
}
void push_queue(queue_lr* p, int data) {
queue_lnode* s = p->rear;
p->rear = new queue_lnode;
if ((p->rear) == nullptr) {
exit(-1);
}
p->rear->data = data;
(p->rear)->next = s->next;
s->next = p->rear;
cout << "成功进队一个元素" << endl;
return;
}
bool queue_is_empty(queue_lr* p) {
if (p->rear == p->front) {
return true;
}
return false;
}
int pop_queue(queue_lr* p) {
if (queue_is_empty(p)) {
cout << "queue is empty!" << endl;
exit(-1);
}
cout << "出队一个元素" << endl;
queue_lnode* rr = (p->front)->next;
int data = rr->data;
(p->front)->next = rr->next;
rr->next = nullptr;
delete rr;
return data;
}
int print_queue(queue_lr* p) {
queue_lnode* t = p->front->next;
int i = 0;
cout << "----打印队内元素---" << endl;
cout << "队头" << endl;
while (t != (p->rear)) {
cout << t->data << endl;
t = t->next;
i++;
}
cout << "队尾" << endl;
cout << "------------------" << endl;
return i;
}
int main() {
queue_lr* p = init_queue();
for (int i = 0; i < 5; i++) {
push_queue(p, i);
}
cout<<"当前队内元素个数:"<< print_queue(p) << endl;
for (int j = 0; j < 2; j++) {
cout << pop_queue(p) << endl;
}
cout << "当前队内元素个数:" << print_queue(p) << endl;
return 0;
}
以下为代码运行结果: