数据结构 队列

队列

代码

#include <stdio.h>
#include <stdlib.h>/************************************************************************/
/* 队列结构要素：队列容量  内存指针  元素个数  队列头  对列尾*/
/************************************************************************/#define QUEUE_CAPACITY 3    //队列容量typedef struct tag_queue
{int *pQueue;   //队列内存指针int head;      //队列头int tail;      //队列尾int length;    //元素个数
}LineQueue;int InitQueue(LineQueue **myQueue);               //InitQueue(&Q)             创建队列
void DestroyQueue(LineQueue *myQueue);           //DestroyQueue(&Q)          销毁队列
void ClearQueue(LineQueue *myQueue);             //ClearQueue(&Q)            清空队列
int QueueEmpty(LineQueue *myQueue);              //QueueEmpty(&Q)            判空队列
int QueueFull(LineQueue *myQueue);               //QueueFull(&Q)             判满队列
int QueueLength(LineQueue *myQueue);             //QueueLength(&Q)           队列长度
int EnQueue(LineQueue *myQueue, int element);    //EnQueue(&Q, element)      新元素入队
int DeQueue(LineQueue *myQueue, int *element);   //DeQueue(&Q, &element)     首元素出队
void QueueTraverse(LineQueue *myQueue);          //QueueTraverse(Q, visit()) 遍历队列int InitQueue(LineQueue **myQueue)
{(*myQueue) = (LineQueue *)malloc(sizeof(LineQueue));//printf("queue1 = %p\n", (*myQueue));if(myQueue == NULL){return 0;}(*myQueue)->pQueue = (int *)malloc(sizeof(int) * QUEUE_CAPACITY);if((*myQueue)->pQueue == NULL){return 0;}(*myQueue)->head = 0;(*myQueue)->tail = 0;(*myQueue)->length = 0;return 1;
}void DestroyQueue(LineQueue *myQueue)
{free(myQueue->pQueue);myQueue->pQueue = NULL;free(myQueue);myQueue = NULL;
}void ClearQueue(LineQueue *myQueue)
{myQueue->length = 0;myQueue->tail = 0;
}int QueueEmpty(LineQueue *myQueue)
{if(myQueue->length == 0){return 1;}return 0;
}int QueueFull(LineQueue *myQueue)
{if(myQueue->length >= QUEUE_CAPACITY){return 1;}return 0;
}int QueueLength(LineQueue *myQueue)
{return myQueue->length;
}int EnQueue(LineQueue *myQueue, int element)
{if(QueueFull(myQueue)){return 0;}myQueue->pQueue[myQueue->tail] = element;myQueue->tail++;myQueue->length++;return 1;
}int DeQueue(LineQueue *myQueue, int *element)
{int i = 0;if(QueueEmpty(myQueue)){return 0;}*element = myQueue->pQueue[myQueue->head];for(i = 1; i < myQueue->length; i++){myQueue->pQueue[i-1] = myQueue->pQueue[i];}myQueue->length--;myQueue->tail--;return 1;
}void QueueTraverse(LineQueue *myQueue, int flag)
{int i = 0;if(flag == 0)  //从头到尾{for(i = 0; i < myQueue->length; i++){printf("%d ", myQueue->pQueue[i]);}}if(flag == 1)  //从尾到头{for(i = myQueue->length - 1; i >= 0; i--){printf("%d ", myQueue->pQueue[i]);}}
}int main(void)
{int elem = 0;LineQueue *queue = NULL;InitQueue(&queue);if(QueueEmpty(queue)){printf("当前队列为空\n");}EnQueue(queue, 2);EnQueue(queue, 4);EnQueue(queue, 5);if(QueueFull(queue)){printf("当前队列为满\n");}QueueTraverse(queue, 0);printf("\n-----------------------\n");/*DeQueue(queue, &elem);printf("elem = %d\n", elem);DeQueue(queue, &elem);printf("elem = %d\n", elem);DeQueue(queue, &elem);printf("elem = %d\n", elem);*/printf("queueLength = %d\n", QueueLength(queue));ClearQueue(queue);if(QueueEmpty(queue)){printf("当前队列为空\n");}//QueueTraverse(queue, 1);//printf("queue2 = %p\n", queue);DestroyQueue(queue);system("pause");return 0;
}

注意事项

  • %p 打印地址信息

我的代码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>#define QUEUE_CAPACITY 3 //队列容量typedef struct tag_queue{int *pQueue;int head;int tail;int length;
}LineQueue;int InitQueue(LineQueue **myQueue);               //InitQueue(&Q)             创建队列
void DestroyQueue(LineQueue *myQueue);           //DestroyQueue(&Q)          销毁队列
void ClearQueue(LineQueue *myQueue);             //ClearQueue(&Q)            清空队列
int QueueEmpty(LineQueue *myQueue);              //QueueEmpty(&Q)            判空队列
int QueueFull(LineQueue *myQueue);               //QueueFull(&Q)             判满队列
int QueueLength(LineQueue *myQueue);             //QueueLength(&Q)           队列长度
int EnQueue(LineQueue *myQueue, int element);    //EnQueue(&Q, element)      新元素入队
int DeQueue(LineQueue *myQueue, int *element);   //DeQueue(&Q, &element)     首元素出队
void QueueTraverse(LineQueue *myQueue,int flag);          //QueueTraverse(Q, visit()) 遍历队列int main(){//单元测试LineQueue *queue = nullptr;InitQueue(&queue);printf("queue out = %p\n",queue);if (QueueEmpty(queue)){printf("当前队列为空\n");}EnQueue(queue,2);EnQueue(queue,4);EnQueue(queue,5);if (QueueEmpty(queue)){printf("当前队列为空\n");}QueueTraverse(queue,0);printf("\n");QueueTraverse(queue,1);printf("\n");int elem = 0;DeQueue(queue,&elem);printf("elem = %d \n", elem);QueueTraverse(queue,0);DestroyQueue(queue);return 0;
}
int InitQueue(LineQueue **myQueue){//InitQueue(&Q)             创建队列*myQueue = static_cast<LineQueue *>(malloc(sizeof(LineQueue)));//单个printf("queue in = %p\n",(*myQueue));//给所有容量分配内存(*myQueue)->pQueue = static_cast<int *>(malloc(sizeof(int ) * QUEUE_CAPACITY));(*myQueue)->head = 0;(*myQueue)->tail = 0;(*myQueue)->length = 0;if (myQueue == nullptr){return 0;}elsereturn 1;
}void DestroyQueue(LineQueue *myQueue){free(myQueue->pQueue);myQueue->pQueue = nullptr;free(myQueue);myQueue = nullptr;
}void ClearQueue(LineQueue *myQueue){myQueue->length = 0;myQueue->tail = 0;
}int QueueEmpty(LineQueue *myQueue){if (myQueue->length == 0){return 1;}return 0;
}int QueueFull(LineQueue *myQueue){if (myQueue->length == QUEUE_CAPACITY){return 1;}return 0;
}int QueueLength(LineQueue *myQueue){return myQueue->length;
}int EnQueue(LineQueue *myQueue, int element)
{if(QueueFull(myQueue)){return 0;}myQueue->pQueue[myQueue->tail] = element;myQueue->tail++;myQueue->length++;return 1;
}int DeQueue(LineQueue *myQueue, int *element){if (QueueEmpty(myQueue)){return 0;}*element = myQueue->pQueue[myQueue->head];for (int i = 1; i < myQueue->length; ++i) {myQueue->pQueue[i-1] = myQueue->pQueue[i];}myQueue->length--;myQueue->tail--;
}void QueueTraverse(LineQueue *myQueue,int flag){if (flag == 0){//从头到尾for (int i = 0; i < myQueue->length; ++i) {printf("%d ",myQueue->pQueue[i]);}}if (flag == 1){//从尾到头for (int i = myQueue->length-1; i >=0; --i) {printf("%d ",myQueue->pQueue[i]);}}
}

环形队列

#include <stdio.h>
#include <stdlib.h>
#include <string.h>#define QUEUE_CAPACITY 3 //队列容量typedef struct tag_queue{int *pQueue;int head;int tail;int length;
}RingQueue;int InitQueue(RingQueue **myQueue);               //InitQueue(&Q)             创建队列
void DestroyQueue(RingQueue *myQueue);           //DestroyQueue(&Q)          销毁队列
void ClearQueue(RingQueue *myQueue);             //ClearQueue(&Q)            清空队列
int QueueEmpty(RingQueue *myQueue);              //QueueEmpty(&Q)            判空队列
int QueueFull(RingQueue *myQueue);               //QueueFull(&Q)             判满队列
int QueueLength(RingQueue *myQueue);             //QueueLength(&Q)           队列长度
int EnQueue(RingQueue *myQueue, int element);    //EnQueue(&Q, element)      新元素入队
int DeQueue(RingQueue *myQueue, int *element);   //DeQueue(&Q, &element)     首元素出队
void QueueTraverse(RingQueue *myQueue,int flag);          //QueueTraverse(Q, visit()) 遍历队列int main(){//单元测试RingQueue *queue = nullptr;InitQueue(&queue);printf("queue out = %p\n",queue);if (QueueEmpty(queue)){printf("当前队列为空\n");}EnQueue(queue,2);EnQueue(queue,4);EnQueue(queue,5);if (QueueEmpty(queue)){printf("当前队列为空\n");}QueueTraverse(queue,0);printf("\n");QueueTraverse(queue,1);printf("\n");int elem = 0;DeQueue(queue,&elem);printf("elem = %d \n", elem);QueueTraverse(queue,0);DestroyQueue(queue);return 0;
}
int InitQueue(RingQueue **myQueue){//InitQueue(&Q)             创建队列*myQueue = static_cast<RingQueue *>(malloc(sizeof(RingQueue)));//单个printf("queue in = %p\n",(*myQueue));//给所有容量分配内存(*myQueue)->pQueue = static_cast<int *>(malloc(sizeof(int ) * QUEUE_CAPACITY));(*myQueue)->head = 0;(*myQueue)->tail = 0;(*myQueue)->length = 0;if (myQueue == nullptr){return 0;}elsereturn 1;
}void DestroyQueue(RingQueue *myQueue){free(myQueue->pQueue);myQueue->pQueue = nullptr;free(myQueue);myQueue = nullptr;
}void ClearQueue(RingQueue *myQueue){myQueue->length = 0;myQueue->tail = 0;myQueue->head = 0;
}int QueueEmpty(RingQueue *myQueue){if (myQueue->length == 0){return 1;}return 0;
}int QueueFull(RingQueue *myQueue){if (myQueue->length == QUEUE_CAPACITY){return 1;}return 0;
}int QueueLength(RingQueue *myQueue){return myQueue->length;
}int EnQueue(RingQueue *myQueue, int element)
{if(QueueFull(myQueue)){return 0;}myQueue->pQueue[myQueue->tail] = element;myQueue->tail++;myQueue->tail %= QUEUE_CAPACITY;myQueue->length++;return 1;
}int DeQueue(RingQueue *myQueue, int *element){if (QueueEmpty(myQueue)){return 0;}*element = myQueue->pQueue[myQueue->head];myQueue->head %= QUEUE_CAPACITY;  myQueue->length--;myQueue->tail--;
}void QueueTraverse(RingQueue *myQueue,int flag){if (flag == 0){//从头到尾for (int i = 0; i < myQueue->length + myQueue->head; ++i) {printf("%d ",myQueue->pQueue[i % QUEUE_CAPACITY]);}}if (flag == 1){//从尾到头for (int i = myQueue->tail -1; i >=myQueue->tail - myQueue->length; --i) {printf("%d ",myQueue->pQueue[(i + QUEUE_CAPACITY) % QUEUE_CAPACITY]);}}
}

环形队列 存储 学生信息结构体

#include <stdio.h>
#include <stdlib.h>
#include <string.h>#define QUEUE_CAPACITY 3 //队列容量typedef struct tag_student{char name[30];int age;
}Student;typedef struct tag_queue{Student *pQueue;int head;int tail;int length;
}RingQueue;int InitQueue(RingQueue **myQueue);               //InitQueue(&Q)             创建队列
void DestroyQueue(RingQueue *myQueue);           //DestroyQueue(&Q)          销毁队列
void ClearQueue(RingQueue *myQueue);             //ClearQueue(&Q)            清空队列
int QueueEmpty(RingQueue *myQueue);              //QueueEmpty(&Q)            判空队列
int QueueFull(RingQueue *myQueue);               //QueueFull(&Q)             判满队列
int QueueLength(RingQueue *myQueue);             //QueueLength(&Q)           队列长度
int EnQueue(RingQueue *myQueue, Student* stu);    //EnQueue(&Q, element)      新元素入队
int DeQueue(RingQueue *myQueue, Student* stu);   //DeQueue(&Q, &element)     首元素出队
void QueueTraverse(RingQueue *myQueue,int flag);          //QueueTraverse(Q, visit()) 遍历队列void printInfo(Student *stu);//打印结构体信息int main(){//单元测试RingQueue *queue = nullptr;InitQueue(&queue);Student stu1 = {"zhangsan",10};if (QueueEmpty(queue)){printf("当前队列为空\n");}EnQueue(queue,&stu1);QueueTraverse(queue,0);Student stu2{};DeQueue(queue,&stu2);printInfo(&stu2);return 0;
}
int InitQueue(RingQueue **myQueue){//InitQueue(&Q)             创建队列*myQueue = static_cast<RingQueue *>(malloc(sizeof(RingQueue)));//单个printf("queue in = %p\n",(*myQueue));//给所有容量分配内存(*myQueue)->pQueue = static_cast<Student *>(malloc(sizeof(Student ) * QUEUE_CAPACITY));(*myQueue)->head = 0;(*myQueue)->tail = 0;(*myQueue)->length = 0;if (myQueue == nullptr){return 0;}elsereturn 1;
}void DestroyQueue(RingQueue *myQueue){free(myQueue->pQueue);myQueue->pQueue = nullptr;free(myQueue);myQueue = nullptr;
}void ClearQueue(RingQueue *myQueue){myQueue->length = 0;myQueue->tail = 0;myQueue->head = 0;
}int QueueEmpty(RingQueue *myQueue){if (myQueue->length == 0){return 1;}return 0;
}int QueueFull(RingQueue *myQueue){if (myQueue->length == QUEUE_CAPACITY){return 1;}return 0;
}int QueueLength(RingQueue *myQueue){return myQueue->length;
}int EnQueue(RingQueue *myQueue, Student* stu)
{if(QueueFull(myQueue)){return 0;}
//    myQueue->pQueue[myQueue->tail] = element;
//    strcpy((myQueue->pQueue[myQueue->tail]).name,stu->name);strcpy_s((myQueue->pQueue[myQueue->tail]).name,30,stu->name);(myQueue->pQueue[myQueue->tail]).age = stu->age;myQueue->tail++;myQueue->tail %= QUEUE_CAPACITY;myQueue->length++;return 1;
}int DeQueue(RingQueue *myQueue, Student *element){if (QueueEmpty(myQueue)){return 0;}
//    *element = myQueue->pQueue[myQueue->head];
//    strcpy(element->name,(myQueue->pQueue[myQueue->head]).name);strcpy_s(element->name,30,(myQueue->pQueue[myQueue->head]).name);element->age = myQueue->pQueue[myQueue->head].age;myQueue->head %= QUEUE_CAPACITY;myQueue->length--;myQueue->tail--;
}void QueueTraverse(RingQueue *myQueue,int flag){if (flag == 0){//从头到尾for (int i = 0; i < myQueue->length + myQueue->head; ++i) {
//            printf("%d ",myQueue->pQueue[i % QUEUE_CAPACITY]);printInfo(&(myQueue->pQueue[i % QUEUE_CAPACITY]));printf("\n");}}if (flag == 1){//从尾到头for (int i = myQueue->tail -1; i >=myQueue->tail - myQueue->length; --i) {
//            printf("%d ",myQueue->pQueue[(i + QUEUE_CAPACITY) % QUEUE_CAPACITY]);printInfo(&(myQueue->pQueue[(i + QUEUE_CAPACITY) % QUEUE_CAPACITY]));printf("\n");}}
}void printInfo(Student *stu) {printf("%s ",stu->name);printf("%d ",stu->age);
}

 

本文来自互联网用户投稿，该文观点仅代表作者本人，不代表本站立场。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如若转载，请注明出处：http://www.mzph.cn/news/446610.shtml

如若内容造成侵权/违法违规/事实不符，请联系多彩编程网进行投诉反馈email:809451989@qq.com，一经查实，立即删除！

相关文章

c++面向对象高级编程 学习八 non-explicit-one-argement-ctor

c++面向对象高级编程 学习八 non-explicit-one-argement-ctor

explicit&#xff08;显式的&#xff09;&#xff1a;作用是"禁止单参数构造函数"被用于自动类型转换 non-explicit: class Fraction { public:Fraction(int num,int den1):m_numerator(num),m_denominator(den){}Fraction operator (const Fraction& f){retur…
阅读更多...
操作系统 IO管理

操作系统 IO管理

学什么&#xff1f; I/O input / output 输入&#xff1a;鼠标 键盘 手柄 触摸屏 摄像头 MTC 扫描仪输出&#xff1a;显示器 打印机 耳机 音响 既是输入也是输出&#xff1a;光驱 网卡 磁盘 U盘硬件&#xff1a;设备如何把数据返回到PC机&#xff0c;但是不同种类的设…
阅读更多...
英语口语小组PPT--袁隆平

英语口语小组PPT--袁隆平

文章中文版 大家好,我是第一组的xxx,现在由我来为大家分享在我眼中的袁隆平.在我看来,他值得外界对他的称赞,因为他对中国,对世界的贡献是有目共睹的:他研发的杂交水稻解决了人民的温饱问题,让无数人享受到吃饱的幸福&#xff0c;看到了生活的希望.这足以让他青史留名. 并且他…
阅读更多...
c++面向对象高级编程 学习九 pointer-like classes

c++面向对象高级编程 学习九 pointer-like classes

c的class设计出来有两种形式&#xff0c;一种像指针&#xff0c;一种像函数 智能指针里包含普通指针&#xff0c;要写 * 和 -> 的函数 sp->method(); //sp-> 经 T* operator*() const 函数&#xff0c;得到px //由于 箭头符号&#xff08;->&#xff09;作用下去…
阅读更多...
const int *a和int*const a 的区别详解

const int *a和int*const a 的区别详解

补充知识 “const int i”与“int const i”之间的区别对变量来说&#xff0c;const 关键字可以限定一个变量的值不允许改变&#xff0c;从而保护被修饰的东西&#xff0c;防止意外修改&#xff0c;在一定程度上可以提高程序的安全性和可靠性。 代码 const int * int i1 10…
阅读更多...
codeforces 133A-C语言解题报告

codeforces 133A-C语言解题报告

133A题目网址 题目解析 1.输入字符串,如果里面包含H,Q,9,就输出YES,否则输出NO 代码 #include<stdio.h> #include<stdlib.h> #include<string.h>int main() {char c[100]{0};int flag0;int i;scanf("%s",c);for(i0;i<strlen(c);i){if(c[i]H…
阅读更多...
c++面向对象高级编程 学习十 function-like classes

c++面向对象高级编程 学习十 function-like classes

本节是设计一个class&#xff0c;使它的行为像一个函数。 如果一个东西能接受小括号()操作符&#xff0c;那么这个东西就称之为函数&#xff0c;或像函数的东西。 下图为三个函数对()的重载&#xff0c;这三个类均为像函数的类&#xff0c;它们可接受()操作符&#xff0c; 标…
阅读更多...
数据结构 栈

数据结构 栈

代码 #include <stdio.h> #include <stdlib.h>/************************************************************************/ /*栈应用示例--数制转换要求&#xff1a;输入任意的正整数N(十进制)&#xff0c;分别输出该整数的二进制、八进制、十六进制的结果算法…
阅读更多...
英语口语 Week14 Monday

英语口语 Week14 Monday

英语文章 Thailand, a country in Southeast Asia with an area of about 514,000 square kilometers, has been increasingly prosperous in its tourism industry in the past few decades. Its capital is Bangkok and its major languages are Thai, Chinese and English.…
阅读更多...
c++面向对象高级编程 学习十一 类模板、函数模板、成员模板

c++面向对象高级编程 学习十一 类模板、函数模板、成员模板

namespace经验谈&#xff1a; 团队中函数或类的名字可能会冲突&#xff0c;因此使用namespace进行区分。 类模板&#xff1a; template<typename T> 函数模板&#xff1a; template<class T>&#xff0c;此处class可改成typename 函数模板在使用的时候&#xff0…
阅读更多...
操作系统面试 总结

操作系统面试 总结

以下文章来源于程序员cxuan &#xff0c;作者cxuan 原文链接什么是操作系统 操作系统是管理硬件和软件的一种应用程序。操作系统是运行在计算机上最重要的一种软件&#xff0c;它管理计算机的资源和进程以及所有的硬件和软件。它为计算机硬件和软件提供了一种中间层&#xff…
阅读更多...
英语口语week 14 Thursday

英语口语week 14 Thursday

英语文章 A couple decided to go out to celebrate their wedding anniversary, so they called a babysitter. When the babysitter arrived, the two children had already been asleep. The babysitter soon got bored and went to the kitchen where she blended some wh…
阅读更多...
c++面向对象高级编程 学习十二 模板

c++面向对象高级编程 学习十二 模板

模板特化&#xff1a; 模板是一种泛化的形式&#xff0c;特化是将参数类型进行指定&#xff0c;写出特化的版本&#xff0c;当在调用下图cout<<hash()(1000);的时候&#xff0c;由于特化中有struct hash{ }的版本&#xff0c;因此会直接调用特化部分。 模板偏特化&…
阅读更多...
英语口语 week14 Friday

英语口语 week14 Friday

英语文章 Shopping is taking place every second. However, the prices of the same goods may differ from store to store. A name-brand dress may cost several hundred pounds at a boutique, but only half the price in a discount store or a big chain store. Moreo…
阅读更多...
c++面向对象高级编程 学习十三 数量不定的模板参数，auto，for

c++面向对象高级编程 学习十三 数量不定的模板参数，auto，for

文章目录数量不定的模板参数autoranged-base for数量不定的模板参数 void print() {} //... 表示参数的数量不定 template<typename T, typename...Types> void print(const T&firstArg, const Types&...args) {cout << firstArg << endl;cout<&…
阅读更多...
数据结构 树

数据结构 树

定义 树是节点的优先集合度&#xff1a;孩子的数量&#xff0c;度为0 就是终端节点&#xff0c;不为零就是根节点有序树&#xff1a;有顺序&#xff0c;不可以替换无序树&#xff1a;无顺序&#xff0c;可以替换深度 和 树的深度相反&#xff0c;第一层深度为1 树的深度为 3 二…
阅读更多...
英语口语 Week15 TuesDay

英语口语 Week15 TuesDay

英语文章 One day, when Bella was doing sports in the school yard, the squirrel fled out of her sleeve. Threading its way through a considerable number of people, the squirrel disappeared in the distance After a sequence of movements, it hopped onto the ar…
阅读更多...
c++面向对象高级编程 学习十四 引用

c++面向对象高级编程 学习十四 引用

文章目录referencereference的常见用途reference 变量有三种形式&#xff1a;值&#xff0c;指针&#xff0c;引用 int x0; //值 int* p&x;//指向整型的指针&#xff0c;地址&#xff0c;指针在之后的程序中可以指向其他变量 int& rx;//引用&#xff0c;此处表示 r代…
阅读更多...
google浏览器 隐藏功能开启

google浏览器 隐藏功能开启

网址 chrome://flags/ 1&#xff0c;多线程下载 2&#xff0c;暗黑模式3&#xff0c;标签缩略图4&#xff0c;PWA 渐进式web应用 网页即应用5&#xff0c;阅读模式&#xff0c;排除广告&#xff0c;点击阅读模式去除干扰chrome://net-internals6&#xff0c;解决有问题的代理IP…
阅读更多...
英语口语Week 15 Wednesday

英语口语Week 15 Wednesday

英语文章 Accomplishing the task assigned by the teacher; Julia rushed out. Squatting at the gate and playing with the squirrel, Bella waved at the sight of Julia and yelled out here" . Julia ran quickly towards them, pointed at the squirrel and asked…
阅读更多...
最新文章

Copyright @ 2022~2023