9月12日学习日志:
Queue程序如下:
man.c
#include <stdio.h>
#include "queue.h"
int main()
{
int i,ret;
Q queue; //定义队列
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 = DestoryQueue(&queue);
if (ret == SUCCESS)
{
printf("Destory Success!\n");
}
else
{
printf("Destory Failure!\n");
}
return 0;
}
queue.c
#include "queue.h"
#include<stdlib.h>
int InitQueue(Q *q)
{
if(NULL == q) //入参判断
{
return FAILURE;
}
//申请一块内存空间,并且让data指针指向这快空间
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 DestoryQueue(Q *q)
{
if (NULL == q)
{
return FAILURE;
}
free(q->data); //释放空间
q->data = NULL;
return SUCCESS;
}
queue.h
#ifndef QUEUE_H
#define QUEUE_H
#define MAXSIZE 10 //队列的容量
#define SUCCESS 1000
#define FAILURE 1001
struct 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 ClearQeue(Q *q);
int DestoryQueue(Q *q);
#endif
LinkQueue程序如下:
main.c
#include "queue.h"
#include<stdio.h>
int main()
{
int i,ret;
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(ret == SUCCESS)
{
printf("queue is empty!\n");
}
else
{
printf("queue is not empty!\n");
}
ret = DestoryQueue(&queue);
if (ret == SUCCESS)
{
printf("Destory Success!\n");
}
else
{
printf("Destory Failure!\n");
}
return 0;
}
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) //while (p != NULL)
{
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 DestoryQueue(Q **q)
{
if (NULL == q)
{
return FAILURE;
}
free((*q)->front); //释放头结点
free(*q); //释放队列信息
*q = NULL;
return SUCCESS;
}
queue.h
#ifndef QUEUE_H
#define QUEUE_H
#define SUCCESS 1000
#define FAILURE 1001
struct 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 DestoryQueue(Q **q);
#endif