实现的代码如下：
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
| #include<iostream>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cassert>
using namespace std;
//循环队列
template<typename T>
class LoopQueue{
private:
int size;
int tail;
int front;
int capacity;
T *data;
public:
LoopQueue(int capacity){
data=new T[capacity+1];
this->capacity=capacity;
this->size=this->tail=this->front=0;
}
LoopQueue(){
data=new T[10];
this->capacity=10;
this->size=this->tail=this->front=0;
}
~LoopQueue(){
delete []data;
data= nullptr;
}
//获得队列中容量的大小
int Capacity(){
return this->capacity;
}
//获得队列中元素的个数
int getSize(){
return this->size;
}
//判断队列是否为空
bool isEMpty(){
return front==tail;
}
//入队操作
void enqueue(T elem){
if(size>=capacity)
resize(2*capacity);
else {
data[tail]=elem;
tail=(tail+1)%capacity;
size++;
}
}
//改变队列的容量
void resize(int newcapacity){
T *newdata=new T[newcapacity+1];
for(int i=0;i<size;i++){
newdata[i]=data[(front+1)%capacity];
}
tail=size;
data=newdata;
front=0;
this->capacity=newcapacity;
}
//出队操作
T dequeue(){
assert(!isEMpty());
T ret=data[front];
front=(front+1)%capacity;
size--;
if(size<=capacity/4&&capacity/2!=0)
resize(capacity/2);
return ret;
}
//获取循环队列中队头的元素
T getFront(){
assert(!isEMpty());
return data[front];
}
//打印循环队列中的元素
void PrintLoopqueue1(){
for(int i=front;i!=tail;i=(i+1)%capacity){
cout<<data[i]<<" ";
}
cout<<endl;
}
//打印循环队列中的元素
void PrintLoopqueue2(){
for(int i=0;i<size;i++){
cout<<data[(i+front)%capacity]<<" ";
}
cout<<endl;
}
};
int main(){
LoopQueue <int> *arr =new LoopQueue<int>();
for(int i=0;i<5;i++)
arr->enqueue(i+1);
arr->PrintLoopqueue1();
arr->PrintLoopqueue2();
cout<<arr->dequeue()<<endl;
arr->PrintLoopqueue1();
arr->PrintLoopqueue2();
cout<<arr->getFront()<<endl;
return 0;
}
|
-
Next Post
链表
-
Previous Post
数组队列
