数据结构 循环队列的基本操作 C语言_数据结构队列的基本操作c++代码

#include<assert.h>
#include<stdio.h>
#include<stdlib.h>

#define size 10

typedef int ElemType;
typedef struct SqCycleQueue
{
 ElemType *space;
 int head;
 int tail;
 int queuesize;
}SqQue,*SqQuePtr;

static int Full(SqQuePtr sq)//判满
{
 if((sq->tail +1)%sq->queuesize ==sq->head ) return true;
 return false;
}

static int AppendSpace(SqQuePtr sq)//队满，申请空间 
{
 int i,j;
 if(sq->queuesize ==0)
 {
  sq->queuesize =size;
 }
 ElemType *s=(ElemType *)malloc(sizeof(ElemType)*sq->queuesize *2);
 assert(s!=NULL);
 if(s==NULL) return false;
 //挪数据
 for(i=sq->head ,j=0;i!=sq->tail ;i=i+1,j++)
 {
  s[j]=sq->space [i];
 }
 sq->head =0;
 sq->tail =sq->queuesize -1;
 sq->queuesize *=2;
 free(sq->space );
 sq->space =s;
 return true;
}

int Empty_SqQueue(SqQuePtr sq)//判空
{
 assert(sq!=NULL);
 if(sq==NULL) exit(0);

 if(sq->head ==sq->tail ) return true;
 return false;
}

int Init_SqQueue(SqQuePtr sq)
{
 assert(sq!=NULL);
 if(sq==NULL) exit(0);

 sq->space =(ElemType *)malloc(size * sizeof(ElemType));
 if(sq->space ==NULL) exit(0);

 sq->head =sq->tail =0;
 sq->queuesize =size;
 return true;
}

int Push_SqQueue(SqQuePtr sq,ElemType val)//入队
{
 assert(sq!=NULL);
 if(sq==NULL) exit(0);

 if(Full(sq)&&!AppendSpace (sq))//队满 
 {
  return false;
 }
 sq->space[sq->tail]=val;
 sq->tail =(sq->tail +1)%size;//重设队尾指针
 return true;
}

int Pop_SqQueue(SqQuePtr sq)//出队
{
 assert(sq!=NULL);
 if(sq==NULL) exit(0);

 if(Empty_SqQueue (sq))
 {
  return false;
 }
 sq->head =(sq->head +1)%size;
 return true;
}

ElemType GetHead_SqQueue(SqQuePtr sq)//得到队头元素
{
 assert(sq!=NULL);
 if(sq==NULL) exit(0);
 if(Empty_SqQueue (sq))
 {
  return false;
 }
 return sq->space [sq->head ];
}

void Clear_SqQueue(SqQuePtr sq )//清空
{
 assert(sq!=NULL);
 if(sq==NULL)
 {
  printf("%s:%d :: stack is null, so process will over\n", __FILE__, __LINE__);
  exit(0);
 }
 sq->tail =sq->head =0;
}

void Destroy_SqQueue(SqQuePtr sq)//销毁
{
 assert(sq!=NULL);
 if(sq==NULL)
 {
  printf("%s:%d :: stack is null, so process will over\n", __FILE__, __LINE__);
  exit(0);
 }
 free(sq->space );
 sq->space =NULL;
 sq->queuesize =sq->tail =0;
}

void Show(SqQuePtr sq)//打印队中元素
{
 assert(sq!=NULL);
 if(sq==NULL) exit(0);
 for(int i=sq->head;i<sq->tail ;i++)
 {
  printf("%d ",sq->space [i]);
 }
 printf("\n");
}


int main()
{
 SqQue sq;
 Init_SqQueue(&sq);
 for(int i=1;i<9;i++)
 {
  Push_SqQueue(&sq,i);
 }
 Show (&sq);
 Pop_SqQueue (&sq);
 Show (&sq);
 printf("%d\n",GetHead_SqQueue (&sq));
 Clear_SqQueue (&sq);
 Show (&sq);
 Destroy_SqQueue(&sq);
 Show (&sq);
 return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158

运行结果如下：