姓名:王庆 日期:2018.9.12
今日学习任务:
学习数据结构中队列的结构,线性结构:顺序存储(数组) ,链式存储
今日任务完成情况:
跟谁老师完成今天所有任务,代码量达到500行
今日开发收获:
1,了解并完成了关于顺序存储,顺序队列,链式队列的简单程序编译 2,从文本编辑器进入代码编译流程
今日开发中出现的问题汇总:
在输程序的时候,会少括号,分号。对于顺序存储和链式存储的掌握情况不是很好
今日未解决问题:
C语言基础不好,老师讲的听的不是很懂,对于写程序这块
自我评价:
相比较之前,出现的问题变少了,基本可以编译成功,与同学相互之前也解决了一些小问题,还要加强自我程序编写能力
笔记:
队列结构 (两个端口)先进先出
线性结构:顺序存储(数组)、 链式存储
空对:队头队尾重合
队头front 队尾rear
队尾指针:指向最后一个元素的后一个
循环队列长度:(rear-front + MAXSIZE)%MAXSIZE
判断队列是否满:(rear+1)%MAXSIZE==front
节点分为数据域和指针域
结构体:struct node
{
int data;
struct node *next;
}
队列:struct queue
{
Node *front;
Node *rear
};
struct node
{
};
free(q->front);//释放头结点
free(*q);//释放队列信息
q->rear = q->front; //删完所有结点,队尾指针指向开头
Queue程序如下
queue.h
#ifndef QUEUE_H
#define QUEUE_H
#define MAXSIZE 10
#define SUCCESS 100
#define FAILURE 101
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 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;
}
LinkQueue程序如下
queue,h
#ifndef QUEUE_H
#define QUEUE_H
#define SUCCESS 100
#define FAILURE 101
struct node //jiedian messeage
{
int data; //shujuyu
struct node *next; //zhizhenyu
};
typedef struct node Node;
struct queue //duilie messeage
{
Node *front; //duitouzhizhen
Node *rear; //duiweizhizhen
};
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) //rucanpanduan
{
return FAILURE;
}
(*q)=(Q*)malloc(sizeof(Q)); //geiduilie messeage shenqing kongjian
if(NULL==(*q))
{
return FAILURE;
}
Node *p = (Node *)malloc(sizeof(Node)); //toujiedianshenqingkongjian
if(NULL==p)
{
return FAILURE;
}
(*q)->front = (*q)->rear = p; //duitouzhizhen duiweizhizhen zhixiang toujiedian
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; //zhizhenyu
p->data = e; //shujuyu
q->rear->next = p;
q->rear=p;
return SUCCESS;
}
int DeleteQueue(Q *q)
{
if(NULL==q)
{
return FAILURE;
}
if(q->rear == q->front) //kongdui
{
return FAILURE;
}
Node *p = q->front->next;
int e = p->data;
q->front->next = p->next;
free(p);
if(q->rear == p) //zhisheng yigejiediande qingkuang
{
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) //rucanpanduan
{
return FAILURE;
}
Node *p = q->front->next;
while(p)
{
q->front->next = p->next;
free(p); //shifangjiedian
p = q->front->next; //zhixiangxindejiedian
}
q->rear = q->front; // shanwansuoyoujiedian duiweizhizhen zhixiangkaitou
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); //shifangtoujiedian
free(*q); //shifangduilie messeage
*q = NULL;
return SUCCESS;
}
main,c
#include"queue.h"
#include<stdlib.h>
int InitQueue(Q **q)
{
if(NULL==q) //rucanpanduan
{
return FAILURE;
}
(*q)=(Q*)malloc(sizeof(Q)); //geiduilie messeage shenqing kongjian
if(NULL==(*q))
{
return FAILURE;
}
Node *p = (Node *)malloc(sizeof(Node)); //toujiedianshenqingkongjian
if(NULL==p)
{
return FAILURE;
}
(*q)->front = (*q)->rear = p; //duitouzhizhen duiweizhizhen zhixiang toujiedian
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; //zhizhenyu
p->data = e; //shujuyu
q->rear->next = p;
q->rear=p;
return SUCCESS;
}
int DeleteQueue(Q *q)
{
if(NULL==q)
{
return FAILURE;
}
if(q->rear == q->front) //kongdui
{
return FAILURE;
}
Node *p = q->front->next;
int e = p->data;
q->front->next = p->next;
free(p);
if(q->rear == p) //zhisheng yigejiediande qingkuang
{
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) //rucanpanduan
{
return FAILURE;
}
Node *p = q->front->next;
while(p)
{
q->front->next = p->next;
free(p); //shifangjiedian
p = q->front->next; //zhixiangxindejiedian
}
q->rear = q->front; // shanwansuoyoujiedian duiweizhizhen zhixiangkaitou
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); //shifangtoujiedian
free(*q); //shifangduilie messeage
*q = NULL;
return SUCCESS;
}