質問編集履歴
1
書式の改善
test
CHANGED
|
File without changes
|
test
CHANGED
|
@@ -1,161 +1,11 @@
|
|
|
1
1
|
```ここに言語を入力
|
|
2
|
-
|
|
3
|
-
#include <iostream>
|
|
4
|
-
|
|
5
|
-
using namespace std;
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
class Queue {
|
|
10
|
-
|
|
11
|
-
private:
|
|
12
|
-
|
|
13
|
-
int size;
|
|
14
|
-
|
|
15
|
-
int front;
|
|
16
|
-
|
|
17
|
-
int rear;
|
|
18
|
-
|
|
19
|
-
int count;
|
|
20
|
-
|
|
21
|
-
int *queue;
|
|
22
|
-
|
|
23
|
-
public:
|
|
24
|
-
|
|
25
|
-
Queue( int _size );
|
|
26
|
-
|
|
27
|
-
~Queue( );
|
|
28
|
-
|
|
29
|
-
bool isFull( );
|
|
30
|
-
|
|
31
|
-
bool isEmpty( );
|
|
32
|
-
|
|
33
|
-
void enqueue( int data );
|
|
34
|
-
|
|
35
|
-
int dequeue( );
|
|
36
|
-
|
|
37
|
-
void print( );
|
|
38
|
-
|
|
39
|
-
};
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
Queue::Queue( int _size ) {
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
front = 0;
|
|
48
|
-
|
|
49
|
-
rear = 0;
|
|
50
|
-
|
|
51
|
-
count = 0;
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
queue = new int[ _size ];
|
|
56
|
-
|
|
57
|
-
size = _size;
|
|
58
|
-
|
|
59
|
-
};
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
Queue::~Queue( ) {
|
|
64
|
-
|
|
65
|
-
delete [] queue;
|
|
66
|
-
|
|
67
|
-
};
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
bool Queue::isFull( ) {
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
if( count < size )
|
|
76
|
-
|
|
77
|
-
return 0;
|
|
78
|
-
|
|
79
|
-
else
|
|
80
|
-
|
|
81
|
-
return 1;
|
|
82
|
-
|
|
83
|
-
}
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
bool Queue::isEmpty( ) {
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
if( count == 0 )
|
|
92
|
-
|
|
93
|
-
return 1;
|
|
94
|
-
|
|
95
|
-
else
|
|
96
|
-
|
|
97
|
-
return 0;
|
|
98
|
-
|
|
99
|
-
}
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
void Queue::enqueue( int data ) {
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
queue[ rear ] = data;
|
|
108
|
-
|
|
109
|
-
rear = ( rear + 1 ) % size;
|
|
110
|
-
|
|
111
|
-
count++;
|
|
112
|
-
|
|
113
|
-
}
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
int Queue::dequeue( ) {
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
int removed = queue[ front ];
|
|
122
|
-
|
|
123
|
-
front = ( front + 1 ) % size;
|
|
124
|
-
|
|
125
|
-
count--;
|
|
126
|
-
|
|
127
|
-
return removed;
|
|
128
|
-
|
|
129
|
-
}
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
void Queue::print( ) {
|
|
134
|
-
|
|
135
|
-
cout << "キューの内容: ";
|
|
136
|
-
|
|
137
|
-
for( int i = 0; i < count; i++ ) {
|
|
138
|
-
|
|
139
|
-
cout << queue[( front + i ) % size] << " ";
|
|
140
|
-
|
|
141
|
-
}
|
|
142
|
-
|
|
143
|
-
cout << endl;
|
|
144
|
-
|
|
145
|
-
}
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
2
|
|
|
151
3
|
このクラスのテンプレートを作りたいのですが、作り方が分かりません。
|
|
152
4
|
|
|
153
5
|
書籍を見れば分かると思うのですが今手元にありません。
|
|
154
6
|
|
|
155
|
-
しかし今すぐ作りたいのです
|
|
7
|
+
しかし今すぐ作りたいのですが、参考になるweb等はありますか？
|
|
156
8
|
|
|
157
|
-
実装して見せていただけたら嬉しいです。
|
|
158
9
|
|
|
159
|
-
百聞は一見に如かず方式で、まず実際のコードを見たいのです。
|
|
160
10
|
|
|
161
11
|
```
|