-
Notifications
You must be signed in to change notification settings - Fork 1
/
SeqQueue.h
132 lines (132 loc) · 3.46 KB
/
SeqQueue.h
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
#include<assert.h>
#include<iostream>
#include"Queue.h"
template<class T>
class SeqQueue :public Queue<T> {
public:
SeqQueue(int sz = 10);
~SeqQueue()
{
delete[] elements;
}
bool EnQueue(const T& x); // ���������������������
virtual bool DeQueue(T& x); //�˳���ͷԪ��
virtual bool getFront(T& x);
void makeEmpty() {
front = rear = 0;
}
virtual bool IsEmpty() const {
return (front == rear ? true : false);
}
virtual bool IsFull() const {
return ((rear + 1) % maxSize == front ? true : false);
}
virtual int getSize() const {
return (rear - front + maxSize) % maxSize;
}
void Output() {
if (IsEmpty() == true) { //�����Զ��еIJ�����Ҫ�ȼ��������Ƿ�Ϊ��
std::cout << "��ǰ����Ϊ��" << std::endl;
return;
}
for (int i = front, j = 1; i != rear; (i++) % maxSize, j++) {
std::cout << j << ":" << elements[i] << std::endl;
}
}
protected:
int rear, front; //��β �Ͷ�ͷָ��(��Ϊ��������ʾ�����±�index��Ϊָ��)
T* elements; //������Ϊ�������ݽṹ
int maxSize;
};
template<class T>
SeqQueue<T>::SeqQueue(int sz) {
this->front = 0;
this->rear = 0;
this->maxSize = sz;
this->elements = new T[maxSize];
assert(elements != nullptr);
}
template<class T>
bool SeqQueue<T>::EnQueue(const T& x) {
if (IsFull() == true)
return false;
elements[rear] = x;
rear = (rear + 1) % maxSize;
return true;
}
template<class T>
bool SeqQueue<T>::DeQueue(T &x) {
if (front == rear)
return false;
x = elements[front];
front = (front + 1) % maxSize;
return true;
}
template<class T>
bool SeqQueue<T>::getFront(T& x) {
if (IsEmpty() == true)
return false;
x = elements[front];
return true;
}
void print_menu5()
{
std::cout << "1------����Ԫ��������\n"
<< "2------��������Ԫ��\n"
<< "3------��ͷԪ�س����У������س����е�Ԫ��ֵ\n"
<< "4------���ö�ͷԪ��\n"
<< "5------�ж϶����Ƿ�Ϊ��\n"
<< "6------�ж϶����Ƿ�����\n"
<< "7------��ȡ��ǰ���е�Ԫ�ظ���\n"
<< "8------�˳�\n"
<< "��������Ҫ���еIJ�����1-8s��: ";
}
template<class T>
void Menu5(SeqQueue<T> & myQueue)
{
while (true) {
print_menu5();
int n;
std::cin >> n;
switch (n) {
int i;
T x;
case 1:
std::cout << "������Ҫ�������е�Ԫ��" << std::endl;
std::cin >> x;
myQueue.EnQueue(x);
break;
case 2:
myQueue.Output();
break;
case 3:
myQueue.DeQueue(x);
std::cout << "��ͷԪ��" << x << "�Ѿ�������" << std::endl;
break;
case 4:
myQueue.getFront(x);
std::cout << "��ǰ���ж�ͷԪ��Ϊ" << x << std::endl;
break;
case 5:
if (myQueue.IsEmpty())
std::cout << "��ǰ����Ϊ��" << std::endl;
else
std::cout << "��ǰ���в�Ϊ��" << std::endl;
break;
case 6:
if (myQueue.IsFull()) {
std::cout << "��ǰ��������" << std::endl;
}
else {
std::cout << "��ǰ����δ��" << std::endl;
}
break;
case 7:
std::cout << "��ǰ���е�Ԫ�ظ��� " << myQueue.getSize() << std::endl;
break;
default:
std::cout << "�壺ϼ��������" << std::endl;
return;
}
}
}