实现循环链表头文件
This commit is contained in:
@@ -0,0 +1,23 @@
|
||||
//SeqQueue.h
|
||||
|
||||
#ifndef SEQQUEUE_H
|
||||
#define SEQQUEUE_H
|
||||
|
||||
#define MAX_SIZE 100
|
||||
|
||||
typedef struct SeqQueue {
|
||||
int data[MAX_SIZE];
|
||||
int front, rear;
|
||||
} SeqQueue;
|
||||
|
||||
void initSeqQueue(SeqQueue &q);
|
||||
|
||||
bool isEmpty(SeqQueue &q);
|
||||
|
||||
bool isFull(SeqQueue &q);
|
||||
|
||||
void enQueue(SeqQueue &q, int e);
|
||||
|
||||
int deQueue(SeqQueue &q);
|
||||
|
||||
#endif //SEQQUEUE_H
|
||||
Reference in New Issue
Block a user