408/CSPostgraduate-408
1
0
Fork 0
mirror of https://github.com/CodePanda66/CSPostgraduate-408.git synced 2023-05-21 21:49:33 +08:00
Code Issues Projects Releases Wiki Activity

🚚 add func define

Browse Source
This commit is contained in:
Kim Yang
2020-08-16 14:15:35 +08:00
parent f7b45ed07c
commit f8d4e36746
9 changed files with 93 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
DataStructure/DS_2_StackAndQueue/DS_2_3_SqQueue0.cpp
View File

@@ -14,15 +14,23 @@ typedef struct {
int data[MaxSize];//
int front, rear;//对头指针和队尾指针
} SqQueue;
//函数声明
void InitQueue(SqQueue &Q);//初始化
bool QueueEmpty(SqQueue Q);//判空
bool EnQueue(SqQueue &Q, int t);//入队操作
bool DeQueue(SqQueue &Q, int &x);//出队操作
bool GetHead(SqQueue Q, int &x);//获取队头元素,用x返回
/**定义模块**/
/**实现模块**/
//初始化
void InitQueue(SqQueue &Q) {
Q.rear = Q.front = 0;//初始化时，队头队尾都指向0
}
//判空
bool QueueEmpty(SqQueue Q) {
if (Q.front == Q.rear)
return true;
@@ -30,7 +38,6 @@ bool QueueEmpty(SqQueue Q) {
return true;
}
//入队操作
bool EnQueue(SqQueue &Q, int t) {
if ((Q.rear + 1) % MaxSize == Q.front)return false;//队满，注意这里的判满条件
//这里的判满条件会造成浪费一个存储空间的问题
@@ -39,7 +46,6 @@ bool EnQueue(SqQueue &Q, int t) {
return true;
}
//出队操作
bool DeQueue(SqQueue &Q, int &x) {
if (Q.rear == Q.front)return false;//队空
x = Q.data[Q.front];
@@ -47,12 +53,12 @@ bool DeQueue(SqQueue &Q, int &x) {
return true;
}
//获取队头元素,用x返回
bool GetHead(SqQueue Q, int &x) {
if (Q.front == Q.rear)return false;
x = Q.data[Q.front];
return true;
}
/**实现模块**/
/**测试模块**/