안선생의 개발 블로그
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
|
#include<iostream>
using namespace std;
struct Queue
{
int size;
int front;
int rear;
int* q;
};
void create(Queue& q, int size)
{
q.size = size;
q.front = q.rear = -1;
q.q = new int[q.size];
}
void create2(Queue& q, int size) //순환큐
{
q.size = size;
q.front = q.rear = 0;
q.q = new int[q.size];
}
void enqueue(Queue* q, int x)
{
if (q->rear == q->size - 1)
cout << "Queue is FUll";
else
{
q->q[++q->rear] = x;
}
}
void enqueue2(Queue* q, int x) //순환큐
{
if ((q->rear+1)%q->size == q->front)
cout << "Queue is FUll";
else
{
q->rear = (q->rear + 1) % q->size;
q->q[q->rear] = x;
}
}
int dequeue(Queue* q)
{
int x = -1;
if (q->front == q->rear)
cout << "Queue is Empty";
else
{
x = q->q[++q->front];
}
return x;
}
void Display(Queue q)
{
for (int i = q.front + 1; i <= q.rear; i++)
{
cout << q.q[i] << " ";
}
}
void Display2(Queue q) //순환큐
{
int i = q.front + 1;
do
{
cout << q.q[i]<<" ";
i = (i + 1) % q.size;
} while (i != (q.rear + 1) % q.size);
}
int main()
{
Queue q;
/*create(q, 5);
enqueue(&q, 1);
enqueue(&q, 2);
enqueue(&q, 3);
dequeue(&q);
Display(q);*/
create2(q, 5);
enqueue2(&q, 1);
enqueue2(&q, 2);
enqueue2(&q, 3);
enqueue2(&q, 4);
enqueue2(&q, 5);
enqueue2(&q, 6);
//dequeue(&q);
Display2(q);
return 0;
}
|
cs |
'알고리즘' 카테고리의 다른 글
| link Queue (0) | 2022.11.07 |
|---|---|
| Queue C++ (0) | 2022.11.07 |
| Link stack 최종 (0) | 2022.10.30 |
| Link stack C++ (0) | 2022.10.30 |
| ADT stack (0) | 2022.10.30 |