{"data":{"site":{"siteMetadata":{"title":"HOME | blackpudding","subtitle":"고생했어. 오늘도.","copyright":"© All rights reserved.","author":{"name":"William JO","github":"blackpudding96"},"disqusShortname":"blackpudding","url":"https://blackpudding.netlify.com"}},"markdownRemark":{"id":"eb257e29-7fe8-5c4a-8501-85d81281c1fc","html":"

10828번 : 스택

\n

👉 문제 바로가기

\n

배경 지식

\n\n

푼 방법

\n

스택의 개념과 구현 방법을 알고 있다면 배열 혹은 링크드리스트를 이용해서 쉽게 풀 수 있는 문제이다. (나는 배열을 이용해서 풀었다.)

\n

추후에 ‘자료구조’ 섹션에서 ‘스택’에 대해 자세히 다룰 예정이다.

\n

내 정답 코드 (C++)

\n
#include <iostream>\n#include <string>\n\ntemplate <typename T>\nclass Stack {\nprivate:\n\tT *data; // 데이터 배열(arr)\n\tint capacity; // 스택의 크기\n\tint top_idx; // 스택 맨 위 인덱스 = 제일 최근 인덱스\n\t\npublic:\n\t//생성자\n\tStack(int capacity = 1000) : data(new T[capacity]), capacity(capacity), top_idx(-1) {}\n\t\n\t//소멸자\n\t~Stack() {delete[] data;}\n\t\n\tvoid push(T value) {\n\t\tif(!is_full())\n\t\t\tthis->data[++(this->top_idx)] = value;\n\t\telse\n\t\t\tstd::cout << \"Stack is full.\" << std::endl;\n\t}\n\t\n\tT pop() {\n\t\tif(this->top_idx != -1)\n\t\t\treturn this->data[(this->top_idx)--];\n\t\telse\n\t\t\treturn this->top_idx; //std::cout << \"Stack is empty.\" << std::endl;\n\t}\n\t\n\tint size() {\n\t\treturn (this->top_idx)+1;\n\t}\n\t\n\tbool is_empty() {\n\t\treturn (this->top_idx == -1) ? true : false;\n\t}\n\t\n\tT top() {\n\t\treturn (this->top_idx == -1) ? -1 : this->data[this->top_idx];\n\t}\n\t\n\tbool is_full() {\n\t\treturn (this->top_idx == this->capacity) ? true : false;\n\t}\n};\n\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(NULL); \n\tstd::cout.tie(NULL);\n\t\n\tint n;\n\tstd::string op;\n\tStack<int> stack;\n\t\n\tstd::cin >> n;\n\t\n\tfor (int i = 0; i < n; ++i) {\n\t\tstd::cin >> op;\n\t\t\n\t\tif (op == \"push\") {\n\t\t\tint value;\n\t\t\tstd::cin >> value;\n\t\t\tstack.push(value);\n\t\t}\n\t\telse if (op == \"pop\")\n\t\t\tstd::cout << stack.pop() << '\\n';\n\t\telse if (op == \"size\")\n\t\t\tstd::cout << stack.size() << '\\n';\n\t\telse if (op == \"empty\")\n\t\t\tstd::cout << stack.is_empty() << '\\n';\n\t\telse if (op == \"top\")\n\t\t\tstd::cout << stack.top() << '\\n';\n\t}\n    \n    return 0;\n}
\n

References

\n

https://dpdpwl.tistory.com/68
\nhttp://blog.naver.com/PostView.nhn?blogId=tipsware&logNo=221212462913&categoryNo=88&parentCategoryNo=0&viewDate=¤tPage=1&postListTopCurrentPage=1&from=search
\nhttps://blockdmask.tistory.com/45
\nhttps://modoocode.com/219

","fields":{"tagSlugs":["/tags/백준/","/tags/algorithm/"],"slug":"/posts/baekjoons/10828/"},"frontmatter":{"title":"[백준] 10828 : 스택","tags":["백준","Algorithm"],"date":"2020-03-24","description":"백준 10828번 문제 : 스택"}}},"pageContext":{"slug":"/posts/baekjoons/10828/"}}