백준 10828번 스택, 10845번 큐, 10866번 덱 stl 사용하지 않고 구현

stl을 사용한 코드는 아래 링크를 참고하시면 됩니다.

 

https://jaimemin.tistory.com/687

백준 10828번 스택

https://jaimemin.tistory.com/661

백준 10845번 큐

https://jaimemin.tistory.com/837

백준 10866번 덱

 

백준 10828번 스택

	#include <iostream>
	#include <string>
	using namespace std;
	const int MAX = 10000 + 1;
	int idx;
	int arr[MAX];
	// stl 사용하지 않고 구현
	int top(void)
	{
	return arr[idx - 1];
	}
	void push(int num)
	{
	arr[idx++] = num;
	}
	void pop(void)
	{
	idx--;
	}
	int main(void)
	{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int N;
	cin >> N;
	for (int n = 0; n < N; n++)
	{
	string s;
	cin >> s;
	if (s == "push")
	{
	int num;
	cin >> num;
	push(num);
	}
	else if (s == "pop")
	{
	if (idx)
	{
	cout << top() << "\n";
	pop();
	}
	else
	cout << -1 << "\n";
	}
	else if (s == "size")
	{
	cout << idx << "\n";
	}
	else if (s == "empty")
	{
	bool flag = (idx == 0);
	cout << flag << "\n";
	}
	else
	{
	if (idx)
	cout << top() << "\n";
	else
	cout << -1 << "\n";
	}
	}
	return 0;
	}

view raw .cpp hosted with ❤ by GitHub

백준 10845번 큐

	#include <iostream>
	#include <string>
	using namespace std;
	const int MAX = 10000 + 1;
	int head, tail;
	int arr[MAX];
	// stl 사용하지 않고 구현
	void push(int num)
	{
	arr[tail++] = num;
	}
	void pop(void)
	{
	head++;
	}
	int front(void)
	{
	return arr[head];
	}
	int back(void)
	{
	return arr[tail - 1];
	}
	int main(void)
	{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int N;
	cin >> N;
	for (int n = 0; n < N; n++)
	{
	string s;
	cin >> s;
	if (s == "push")
	{
	int num;
	cin >> num;
	push(num);
	}
	else if (s == "pop")
	{
	if (head == tail)
	cout << -1 << "\n";
	else
	{
	cout << front() << "\n";
	pop();
	}
	}
	else if (s == "size")
	{
	cout << tail - head << "\n";
	}
	else if (s == "empty")
	{
	bool flag = (head == tail);
	cout << flag << "\n";
	}
	else if (s == "front")
	{
	if (head == tail)
	cout << -1 << "\n";
	else
	cout << front() << "\n";
	}
	else
	{
	if (head == tail)
	cout << -1 << "\n";
	else
	cout << back() << "\n";
	}
	}
	return 0;
	}

view raw .cpp hosted with ❤ by GitHub

백준 10866번 덱

	#include <iostream>
	#include <string>
	using namespace std;
	const int MAX = (10000 + 1) * 2;
	int head = MAX / 2, tail = MAX / 2;
	int arr[MAX];
	// stl 사용하지 않고 구현
	void push_front(int num)
	{
	arr[--head] = num;
	}
	void push_back(int num)
	{
	arr[tail++] = num;
	}
	void pop_front(void)
	{
	head++;
	}
	void pop_back(void)
	{
	tail--;
	}
	int front(void)
	{
	return arr[head];
	}
	int back(void)
	{
	return arr[tail - 1];
	}
	int main(void)
	{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int N;
	cin >> N;
	for (int n = 0; n < N; n++)
	{
	string s;
	cin >> s;
	if (s == "push_front")
	{
	int num;
	cin >> num;
	push_front(num);
	}
	else if (s == "push_back")
	{
	int num;
	cin >> num;
	push_back(num);
	}
	else if (s == "pop_front")
	{
	if (head == tail)
	cout << -1 << "\n";
	else
	{
	cout << front() << "\n";
	pop_front();
	}
	}
	else if (s == "pop_back")
	{
	if (head == tail)
	cout << -1 << "\n";
	else
	{
	cout << back() << "\n";
	pop_back();
	}
	}
	else if (s == "size")
	{
	cout << tail - head << "\n";
	}
	else if (s == "empty")
	{
	bool flag = (head == tail);
	cout << flag << "\n";
	}
	else if (s == "front")
	{
	if (head == tail)
	cout << -1 << "\n";
	else
	cout << front() << "\n";
	}
	else
	{
	if (head == tail)
	cout << -1 << "\n";
	else
	cout << back() << "\n";
	}
	}
	return 0;
	}

view raw .cpp hosted with ❤ by GitHub

 

개발환경:Visual Studio 2017

 

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~