From b9b236ad74006f0d40d07fb965dd0d1b209d6f30 Mon Sep 17 00:00:00 2001
From: ViolentAyang <76544389+ViolentAyang@users.noreply.github.com>
Date: Sun, 20 Mar 2022 20:12:43 +0800
Subject: [PATCH] =?UTF-8?q?Delete=20=E7=BA=BF=E6=80=A7=E9=98=9F=E5=88=97?=
 =?UTF-8?q?=E7=9A=84=E5=9F=BA=E6=9C=AC=E6=93=8D=E4=BD=9C.c?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 队列/线性队列的基本操作.c | 49 ---------------------------------------
 1 file changed, 49 deletions(-)
 delete mode 100644 队列/线性队列的基本操作.c

diff --git a/队列/线性队列的基本操作.c b/队列/线性队列的基本操作.c
deleted file mode 100644
index bd49eaa..0000000
--- a/队列/线性队列的基本操作.c
+++ /dev/null
@@ -1,49 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h> 
-#include <stdbool.h>
-#define MaxSize 10
-
-//栈是只允许在一段进行插入或删除操作的线性表
-//队列只允许在一端进行插入，在另一端进行删除的线性表
-typedef struct{
-	int data[MaxSize];
-	int front,rear;
-}SqQueue;
-//初始化队列
-void InitQUeue(SqQueue *S){
-	S->front = S->rear = 0;
-}
-//判断队列是否满
-bool QueueFull(SqQueue S){
-	if(S.rear==MaxSize){
-		return true;
-	}
-	return false;
-}
-//判断队列是否为空
-bool QueueEmpty(SqQueue S){
-	if(S.front==S.rear){
-		return true;
-	}else{
-		return false;
-	}
-}
-//入队操作
-bool EnQueue(SqQueue *S,int x){
-	if(QueueFull(*S)){
-		return false;
-	}
-	S->data[S->rear] = x;
-	S->rear += 1;
-	return true;
-}
-
-int main(){
-	SqQueue S;
-	InitQUeue(&S);
-	printf("%d\n",QueueEmpty(S));
-	EnQueue(&S,5);
-	printf("%d\n",QueueEmpty(S));
-	printf("%d\n",S.data[S.rear-1]);
-	return 0;
-}