Algorithm/queue.cpp at master · nvvar/Algorithm · GitHub

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
// queue.cpp: 콘솔 응용 프로그램의 진입점을 정의합니다.
//
#include "stdafx.h"
#define QU 10000
int queue[QU] = { 0 };
void start();
void push(int);
void empty();
int front();
int back();
void pop();
void size();

int main()
{
	string inputS;
	int pushVal;
	cout << "push, empty, front, back, pop, size \n";
	while (1) {
		cin >> inputS;
		if (inputS == "push")
		{
			cin >> pushVal;
			push(pushVal);
		}
		else if (inputS == "empty")
		{
			empty();
		}
		else if (inputS == "front")
		{
			cout << front() << "\n";
		}
		else if (inputS == "back")
		{
			cout << back() << "\n";
		}
		else if (inputS == "pop")
		{
			pop();
		}
		else if (inputS == "size")
		{
			size();
		}
		else if (inputS == "end")
		{
			return 0;
		}
	}
}
void push(int pushVal)
{
	for (int i = 0; i < QU; i++)
	{
		if (*(queue + i) == 0)
		{
			*(queue + i) = pushVal;
			break;
		}
	}
}
void empty()
{
	if (queue[0] == NULL)
	{
		cout << "1\n";
	}
	else
	{
		cout << "0\n";
	}
}
int front()
{
	if (*queue == 0)
	{
		return -1;
	}
	else
		return queue[0];
}
int back()
{
	for (int i = 0; i < QU; i++)
	{
		if (*(queue+0)==0)
		{
			return -1;
		}
		else if (*(queue + i) == 0)
		{
			return *(queue + i - 1);
		}
	}
}
void pop()
{
	cout << *queue << "\n";
	for (int i = 0; i <= QU; i++)
	{
		if (*(queue + 1) == 0)
		{
			*queue = 0;
			break;
		}
		*(queue + i) = *(queue + i + 1);
		if (*(queue + i+2) == 0)
		{
			break;
		}
	}
}
void size()
{
	for (int i = 0; i < QU; i++)
	{
		if (*(queue + i) == 0)
		{
			cout << i << "\n";
			break;
		}
	}
}