苏嵌日志第三天

日志第三天"/>

苏嵌日志第三天

学习日志3
姓名：潘曦
日期：2018.9.12
今日学习任务：
学习关于队列的相关知识：
队列 先进先出
按存储方式分为： 顺序存储 链式存储

队列的顺序存储 ：循环队列
空队：队头队尾重合
队尾指针：指向最后一个元素的后一个
循环队列长度：(rear-front+MAXSIZE) % MAXSIZE
判断队列是否满：（rear+1）%MAXSIZE = front

今日任务完成情况：
任务按时完成，完成约500行代码量。

今日开发中出现的问题汇总：
编写程序时不够认真，会出现一些编写错误。

今日开发收获：
了解了队列的相关知识
顺序队列：初始化队列→进队操作→出队操作→清除队列→释放队列
链式队列：初始化队列→进队操作→出队操作→清除队列→判断是否为空→销毁队列

今日编写的程序：
1、顺序队列
①queue.h

#ifndef QUEUE_H
#define QUEUE_H#define MAXSIZE   10
#define SUCCESS   100
#define FAILURE   101struct queue
{int *data;int front;int rear;
};
typedef struct queue Q;int InitQueue(Q *q);
int EnterQueue(Q *q,int e);
int DelQueue(Q *q);
int LengthQueue(Q q);
int ClearQueue(Q *q);
int DestroyQueue(Q *q);#endif

②queue.c

#include"queue.h"
#include<stdlib.h>
int InitQueue(Q *q)
{if(NULL==q){return FAILURE;}q->data=(int*)malloc(sizeof(int)*MAXSIZE);if(NULL==q->data){return FAILURE;}q->rear=q->front=0;return SUCCESS;
}
int EnterQueue(Q *q,int e)
{if(NULL==q){return FAILURE; }if((q->rear+1)%MAXSIZE==q->front){return FAILURE;}q->data[q->rear]=e;q->rear=(q->rear+1)%MAXSIZE;return SUCCESS;
}int DelQueue(Q *q)
{if(NULL==q){return FAILURE;}if(q->rear==q->front){return FAILURE;}int e=q->data[q->front];q->front=(q->front+1)%MAXSIZE;return e;   
}
int LengthQueue(Q q)
{return (q.rear - q.front + MAXSIZE)%MAXSIZE;
}int ClearQueue(Q *q)
{if(NULL==q){return FAILURE;}q->rear=q->front;return SUCCESS;
}
int DestroyQueue(Q *q)
{if(NULL==q){return FAILURE;}free(q->data);q->data=NULL;return SUCCESS;
}

③main.c

#include <stdio.h>
#include "queue.h"int main()
{Q queue;int ret,i;ret = InitQueue(&queue);if(SUCCESS==ret){printf("Init Success!\n");}   else{printf("Init Failure!\n");}for(i=0;i<10;i++){ret=EnterQueue(&queue,i+1);if(ret==FAILURE){printf("Enter Failure!\n");}else{printf("Enter %d Success!\n",i+1);}}for(i=0;i<5;i++){   ret=DelQueue(&queue);if(ret==FAILURE){   printf("Delete Failure!\n");}else{printf("Delete %d Success!\n",ret);}}ret=LengthQueue(queue);printf("length is %d\n",ret);ret=ClearQueue(&queue);if(ret==SUCCESS){printf("Clear Success!\n");}else{printf("Clear Failure!\n");}ret=DestroyQueue(&queue);if(ret==SUCCESS){printf("Destroy Success!\n");}else{printf("Destroy Failure!\n");}return 0;
}

2、链式队列
①queue.h

#ifndef QUEUE_H
#define QUEUE_H#define SUCCESS  100
#define FAILURE  101struct node      
{int data;       struct node *next;     
};
typedef struct node Node;struct queue     
{Node *front;     Node *rear;  
};
typedef struct queue Q;int InitQueue(Q **q);
int EnterQueue(Q *q,int e);
int DeleteQueue(Q *q);
int LengthQueue(Q *q);
int ClearQueue(Q *q);
int EmptyQueue(Q *q);
int DestroyQueue(Q **q);#endif

②queue.c

#include"queue.h"
#include<stdlib.h>int InitQueue(Q **q)
{if(NULL==q)     {return FAILURE;}(*q)=(Q*)malloc(sizeof(Q)); if(NULL==(*q)){return FAILURE;}Node *p = (Node *)malloc(sizeof(Node));     if(NULL==p){return FAILURE;}(*q)->front = (*q)->rear = p;   return SUCCESS; 
}int EnterQueue(Q *q,int e)
{if(NULL==q){return FAILURE;}Node *p = (Node*)malloc(sizeof(Node));if(NULL==p){return FAILURE;}p->next = NULL; p->data = e;        q->rear->next = p;q->rear=p;return SUCCESS;
}int DeleteQueue(Q *q)
{if(NULL==q){return FAILURE;}if(q->rear == q->front) {return FAILURE;}Node *p = q->front->next;int e = p->data;q->front->next = p->next;free(p);if(q->rear == p)    {q->rear = q->front;}return e;
}int LengthQueue(Q *q)
{if(NULL==q){return FAILURE;}int length=0;Node *p = q->front->next;while(p)        {   length++;p=p->next;}return length;}int ClearQueue(Q *q)
{if(NULL==q) {return FAILURE;}Node *p = q->front->next;while(p){q->front->next = p->next;free(p);    p = q->front->next; }q->rear = q->front; return SUCCESS;
}
int EmptyQueue(Q *q)
{if(NULL==q){return FAILURE;}return (q->front == q->rear)?SUCCESS:FAILURE;
}int DestroyQueue(Q **q)
{if(NULL==q){return FAILURE;}free((*q)->front);      free(*q);   *q = NULL;return SUCCESS;
}

③main.c

#include"queue.h"
#include<stdio.h>int main()
{   int ret,i;Q *queue;ret = InitQueue(&queue);if(ret == SUCCESS){printf("Init Success!\n");}else{printf("Init Failure!\n");}for(i=0;i<10;i++){ret = EnterQueue(queue,i+1);if(ret==SUCCESS){printf("Enter %d Success\n",i+1);}else{printf("Enter Failure\n");}}for(i=0;i<6;i++){ret = DeleteQueue(queue);if(ret == FAILURE){printf("Delete Failure!\n");}else{printf("Delete %d Success!\n",ret);}}ret = LengthQueue(queue);printf("length is %d\n",ret);ret = ClearQueue(queue);if(ret==SUCCESS){printf("Clear Success!\n");}else{printf("Clear Failure!\n");}ret = LengthQueue(queue);printf("length is %d\n",ret);ret = EmptyQueue(queue);if(SUCCESS==ret){printf("queue is empty!\n");}else{printf("queue is not empty!\n");}ret = DestroyQueue(&queue);if(ret==SUCCESS){printf("Destroy Success!\n");}else{printf("Destroy Failure!\n");}return 0;
}