From 3d5327f05a8998462aea55f50493b19f6e0ea1fb Mon Sep 17 00:00:00 2001
From: H1206950012 <39796243+H1206950012@users.noreply.github.com>
Date: Tue, 11 Feb 2020 19:49:30 +0800
Subject: [PATCH] =?UTF-8?q?Update=207.=E9=98=9F=E5=88=97=E7=9A=84=E9=93=BE?=
 =?UTF-8?q?=E5=BC=8F=E5=AD=98=E5=82=A8=E5=AE=9E=E7=8E=B0.c?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 上课Demo/7.队列的链式存储实现.c | 44 ++++++++++++++++-----------------
 1 file changed, 22 insertions(+), 22 deletions(-)

diff --git a/上课Demo/7.队列的链式存储实现.c b/上课Demo/7.队列的链式存储实现.c
index ab51396..8ce55d0 100644
--- a/上课Demo/7.队列的链式存储实现.c
+++ b/上课Demo/7.队列的链式存储实现.c
@@ -7,16 +7,16 @@ struct Node{
 	struct Node *Next;
 };
 struct QNode{
-	struct Node *rear;    // ָ���β��� 
-	struct Node *front;   // ָ���ͷ��� 
+	struct Node *rear;    // 指向队尾结点 
+	struct Node *front;   // 指向队头结点 
 };
 
-Queue CreateQueue();  // ��ʼ������ 
-void AddQ(Queue Q,ElementType item);  //  ���
-ElementType DeleteQ(Queue Q);  // ���� 
-int IsEmpty(Queue Q); // �ж϶����Ƿ�Ϊ�� 
+Queue CreateQueue();  // 初始化队列 
+void AddQ(Queue Q,ElementType item);  //  入队
+ElementType DeleteQ(Queue Q);  // 出队 
+int IsEmpty(Queue Q); // 判断队列是否为空 
 
-// ��ʼ�� 
+// 初始化 
 Queue CreateQueue(){
 	Queue Q;
 	Q = (Queue)malloc(sizeof(struct QNode));
@@ -25,36 +25,36 @@ Queue CreateQueue(){
 	return Q;
 }
 
-// �Ƿ�Ϊ�� 
+// 是否为空 
 int IsEmpty(Queue Q){
 	return (Q->front == NULL);
 }
 
-// ���
+// 入队
 void AddQ(Queue Q,ElementType item){
 	struct Node *node;
 	node = (struct Node *)malloc(sizeof(struct Node));
 	node->Data = item;
 	node->Next = NULL;
-	if(Q->rear==NULL){  //��ʱ���п� 
+	if(Q->rear==NULL){  //此时队列空 
 		Q->rear = node;
 		Q->front = node;
-	}else{ //���� 
-		Q->rear->Next = node;  // �������� 
-		Q->rear = node;   // rear ��Ȼ������� 
+	}else{ //不为空 
+		Q->rear->Next = node;  // 将结点入队 
+		Q->rear = node;   // rear 仍然保持最后 
 	}
 } 
 
-// ����
+// 出队
 ElementType DeleteQ(Queue Q){
 	struct Node *FrontCell;
 	ElementType FrontElem;
 	if(IsEmpty(Q)){
-		printf("���п�");
+		printf("队列空");
 		return 0;
 	}
 	FrontCell = Q->front;
-	if(Q->front == Q->rear){ // ������ֻ��һ��Ԫ�� 
+	if(Q->front == Q->rear){ // 队列中只有一个元素 
 		Q->front = Q->rear = NULL; 
 	}else{
 		Q->front = Q->front->Next;
@@ -67,15 +67,15 @@ ElementType DeleteQ(Queue Q){
 int main(){
 	Queue Q;
 	Q = CreateQueue();
-	printf("���5\n"); 
+	printf("入队5\n"); 
 	AddQ(Q,5);
-	printf("���4\n"); 
+	printf("入队4\n"); 
 	AddQ(Q,4);
-	printf("���4\n"); 
+	printf("入队3\n"); 
 	AddQ(Q,3);
-	printf("����%d\n",DeleteQ(Q));
-	printf("����%d\n",DeleteQ(Q));
-	printf("����%d\n",DeleteQ(Q));
+	printf("出队%d\n",DeleteQ(Q));
+	printf("出队%d\n",DeleteQ(Q));
+	printf("出队%d\n",DeleteQ(Q));
 	printf("%d\n",DeleteQ(Q));
 	return 0;
 }