C++로 스택 구현 / STL stack

< 배열로 구현한 스택 >

 

#include <iostream>

const int MX = 1000005;
int dat[MX];
int pos = 0; // 삽입 인덱스

void push(int x) {
	dat[pos] = x;
	pos++;
}

void pop() {
	pos--;
}

int top() {
	return dat[pos - 1];
}

void test() {
	push(5); push(4); push(3);
	std::cout << top() << '\n'; // 3
	pop(); pop();
	std::cout << top() << '\n'; // 5
	push(10); push(12);
	std::cout << top() << '\n'; // 12
	pop();
	std::cout << top() << '\n'; // 10
}

int main()
{
	test();
}

 

 

< STL stack >

#include <stack>을 포함해주어야 한다!

 

#include <iostream>
#include <stack>

int main()
{
	std::stack<int> stack;
	stack.push(10);
	stack.push(20);
	stack.push(30);

	std::cout << stack.size() << '\n';

	if (stack.empty()) std::cout << "stack is empty\n";
	else std::cout << "stack is not empty\n";

	stack.pop();
	std::cout << stack.top() << '\n';
	stack.pop();
	std::cout << stack.top() << '\n';
	stack.pop();
	if (stack.empty()) std::cout << "stack is empty\n";
	else std::cout << "stack is not empty\n";

	std::cout << stack.top() << '\n';

	return 0;
}

---

< 참고자료 >

https://blog.encrypted.gg/933

[실전 알고리즘] 0x05강 - 스택