循環(huán)隊(duì)列基本操作-華為OJ.docx

/* Copyright (C), 2001-2011, Huawei Tech. Co., Ltd. * File Name : Version : Author : Created : 2012/03/12 Last Modified : Description : Function List : History : 1.Date : 2012/03/12 Author : Modification: Created file*/#include #define MAXSIZE 50struct strqueue int queueMAXSIZE;int head; /* 隊(duì)頭 */int tail; /* 隊(duì)尾 */int num; /* 隊(duì)元素個(gè)數(shù) */;bool initqueue(struct strqueue *s)if (!s)return 0;for (int i = 0; i queuei = 0;s-head = -1;s-tail = -1;s-num = 0;return 1;bool enqueue(struct strqueue *s, int x) /* 進(jìn)隊(duì)列，返回0表示失敗，返回1表示成功 */if (!s)return 0;if (s-num = MAXSIZE)return 0;if (s-head = -1 | s-tail = -1) s-head = 0;s-tail = 0;s-queues-tail = x; /*賦值*/s-num = 1;return 1;s-tail = (s-tail + 1) % MAXSIZE;s-queues-tail = x;s-num+;return 1;bool dequeue(struct strqueue *s, int *x) /* 出隊(duì)列，返回0表示失敗，返回1表示成功 */if (!s | !x)return 0;if (s-num = 0)return 0;*x = s-queues-head; /*賦值*/s-queues-head = 0;s-head = (s-head + 1) % MAXSIZE;/*從對(duì)頭出隊(duì)列*/s-num-;if (s-num = 0) s-head = -1;s-tail = -1;return 1;int gethead(struct strqueue *s) /* 獲得隊(duì)列頭數(shù)值 */if (!s)return -1;if (s-num = 0)return -1;int head = 0;head = s-queues-head;return head;int gettail(struct strqueue *s) /* 獲得隊(duì)列尾數(shù)值 */if (!s)return 0;int tail = 0;if (s-num = 0)return -1;tail = s-queues-tail;return tail;int getqueuelenth(struct strqueue *s) /* 獲得隊(duì)列長(zhǎng)度 */if (!s)return 0;int lenth = 0;lenth = s-num;return lenth;bool search(struct strqueue *s, int x) /* 在隊(duì)列中查找x是否存在，如果存在返回1，否則返回0 */if (!s)return 0;int headTemp = s-head;int tailTemp = s-tail;if (s-num = MAXSIZE) for (int i = 0; i queuei)return 1;else while (headTemp != tailTemp) if (x = s-queueheadTemp)return 1;headTemp = (headTemp + 1) % MAXSIZE;return 0;int main()struct strqueue queue = NULL,