数组实现队列 C++实现(2)

来源：互联网发布：php就业班54期编辑：程序博客网时间：2024/04/30 17:58
/** File name  : LinkLiQt.cpp* Function   : 数组实现队列  C++实现   数组a[0] 一端为head   当 head==tail时为空   tail总指向 队尾元素的下一位置* Created on : 2016年4月25日* Author     : beijiwei@qq.com* Copyright  : 欢迎大家和我一起交流学习，转载请保持源文件的完整性。任何单位和个人不经本人允许不得用于商业用途*/#include <cstdio>#include <iostream>using namespace std;#define MAX 10typedef int Elem_t;typedef struct Aqueue {Elem_t data[MAX];int head;int tail;}Aqueue;void queue_init(Aqueue & Q);void queue_clear(Aqueue & Q);bool queue_is_empty(Aqueue & Q);bool queue_in(Aqueue & Q, Elem_t elem);bool queue_out(Aqueue & Q, Elem_t &elem);int queue_get_length(Aqueue & Q);bool queue_get_head(Aqueue & Q, Elem_t &elem);int main(int argc, char** argv){Aqueue aq;Elem_t elem;queue_init(aq);cout << "queue is empty ? " << queue_is_empty(aq) << endl;for (int i = 0; i < 11; i++) {queue_in(aq, i + 10);}cout << "The length of queue is  " << queue_get_length(aq) << endl;queue_get_head(aq, elem);cout << "The head of queue is  " << elem<< endl;for (int i = 0; i < 11; i++) {queue_out(aq, elem);if (i == 3) {cout << "queue is empty ? " << queue_is_empty(aq) << endl;cout << "The length of queue is  " << queue_get_length(aq) << endl;cout << "The head of queue is  " << elem << endl;}}return 0;}void queue_init(Aqueue & Q){Q.head = 0;Q.tail = 0;}void queue_clear(Aqueue & Q){Q.head = 0;Q.tail = 0;}bool queue_get_head(Aqueue & Q, Elem_t &elem){if (Q.head == Q.tail) {cout << "queue is empty can not get" << endl;return false;}elem = Q.data[Q.head];return true;}bool queue_is_empty(Aqueue & Q){return (Q.head == Q.tail) ? true : false;}bool queue_in(Aqueue & Q, Elem_t elem){if (Q.tail == MAX) {cout << "can not in, queue is full" << endl;return false;}Q.data[Q.tail++] = elem;return true;}bool queue_out(Aqueue & Q, Elem_t &elem){if (Q.head == Q.tail) {cout << "queue is empty can not out" << endl;return false;}elem = Q.data[Q.head++];return true;}int queue_get_length(Aqueue & Q){return  Q.tail -Q.head;}
0 0