안선생의 개발 블로그
link Queue 본문
|
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<iostream>
using namespace std;
class Queue
{
private:
int size;
int front;
int rear;
int* q;
public:
Queue()
{
size = 10;
front = rear = -1;#include<iostream>
using namespace std;
struct node
{
int data;
node* next;
}*front =NULL ,*rear = NULL;
void enqueue(int x)
{
node* q = new node;
if (q == NULL)
cout << "queue full";
else
{
q->data = x;
q->next = NULL;
if (front == NULL)
{
front = rear = q;
}
else
{
rear->next = q;
rear = q;
}
}
}
int dequeue()
{
int x = 1;
node* q = front;
if (front == NULL)
cout << "empty";
else
{
x = q->data;
q = front;
front = front->next;
delete q;
}
return x;
}
void Display()
{
node* q=front;
while (q)
{
cout << q->data<< " ";
q = q->next;
}
}
int main()
{
enqueue(1);
enqueue(2);
enqueue(3);
cout << dequeue();
cout << dequeue();
Display();
return 0;
}
q = new int[size];
}
Queue(int size)
{
this->size = size;
front = rear = -1;
q = new int[this->size];
}
void enqueue(int x);
int dequeue();
void Display();
};
void Queue::enqueue(int x)
{
if (rear == size - 1)
cout << "full queue";
else
{
q[++rear] = x;
}
}
int Queue::dequeue()
{
int x = -1;
if (front == rear)
cout << "empty";
else
{
x = q[++front];
}
return x;
}
void Queue::Display()
{
for (int i = front + 1; i <= rear; i++)
{
cout << q[i] << " ";
}
}
int main()
{
Queue q(5);
q.enqueue(1);
q.enqueue(2);
q.enqueue(3);
cout << q.dequeue();
q.Display();
return 0;
}
|
cs |