{"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":"f73639e4-444a-5cf0-bd60-6d8e9c8e23b4","html":"

2164번 : 카드2

\n

👉 문제 바로가기

\n

배경 지식

\n\n

푼 방법

\n

1 ~ n까지의 수를 먼저 queue에 en_queue한 후, dequeue하면서 버리고 다시 enqueue하기를 queue에 1개의 data node만 남을 때까지 반복한다. 그리고 마지막 data node의 data를 출력한다.

\n

내 정답 코드 (C++)

\n
#include <iostream>\n\ntemplate <typename T>\nstruct Node {\n\tT data;\n\tstruct Node *front;\n\tstruct Node *rear;\n};\n\ntemplate <typename T>\nclass Queue {\nprivate:\n\tNode<T> *head;\n\tNode<T> *tail;\n\tint size;\n\t\npublic:\n\tQueue() : head(nullptr), tail(nullptr) , size(0) {}\n\t~Queue() {\n\t\tif (this->head == nullptr)\n\t\t\treturn;\n\t\t\n\t\tNode<T> *cur = this->tail;\n\t\t\n\t\twhile (cur != nullptr) {\n\t\t\tcur = cur->front;\n\t\t\tdelete this->tail;\n\t\t\tthis->tail = cur;\n\t\t}\n\t\t\n\t\tthis->head = this->tail;\n\t}\n\t\n\tint get_size() {\n\t\treturn this->size;\n\t}\n\t\n\tbool is_empty() {\n\t\treturn this->head == nullptr ? true : false;\n\t}\n\t\n\tvoid en_queue(T value) {\n\t\tNode<T> *node = new Node<T>;\n\t\tnode->data = value;\n\t\tnode->front = nullptr;\n\t\tnode->rear = nullptr;\n\t\t\n\t\tif (is_empty()) // first push.\n\t\t\tthis->head = node;\n\t\telse {\n\t\t\tnode->front = this->tail;\n\t\t\tthis->tail->rear = node;\n\t\t}\n\t\t\n\t\tthis->tail = node;\n\t\t++size;\n\t}\n\t\n\tT de_queue() {\n\t\tif (is_empty()) // empty queue\n\t\t\treturn -1; // T type에 맞는 error code return.\n\t\telse {\n\t\t\tint pop_val = this->head->data;\n\t\t\t\n\t\t\tif (this->head == this->tail) { // queue with 1 element.\n\t\t\t\tdelete this->head;\n\t\t\t\tthis->head = this->tail = nullptr;\n\t\t\t}\n\t\t\telse { // queue with more than 2 elements.\n\t\t\t\tNode<T> *node = new Node<T>;\n\t\t\t\t\n\t\t\t\tnode = this->head->rear;\n\t\t\t\t\n\t\t\t\tdelete this->head;\n\t\t\t\t\n\t\t\t\tthis->head = node;\n\t\t\t\tthis->head->front = nullptr;\n\t\t\t}\n\t\t\t\n\t\t\t--size;\n\t\t\treturn pop_val;\n\t\t}\n\t}\n};\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(NULL); \n\tstd::cout.tie(NULL);\n\t\n\tQueue<int> queue;\n\tint n;\n\tbool discarded = false;\n\t\n\tstd::cin >> n;\n\t\n\tfor (int i = 1; i <= n; ++i)\n\t\tqueue.en_queue(i);\n\t\n\twhile(queue.get_size() != 1) {\n\t\tif (discarded) { // 바닥에 옮기기\n\t\t\tqueue.en_queue(queue.de_queue());\n\t\t\tdiscarded = false;\n\t\t} \n\t\telse { // 바닥에 버리기\n\t\t\tqueue.de_queue();\n\t\t\tdiscarded = true;\n\t\t}\n\t}\n\n\tstd::cout << queue.de_queue() << std::endl;\n\t\n\treturn 0;\n}
","fields":{"tagSlugs":["/tags/백준/","/tags/algorithm/"],"slug":"/posts/baekjoons/2164/"},"frontmatter":{"title":"[백준] 2164 : 카드2","tags":["백준","Algorithm"],"date":"2020-03-31","description":"백준 2164번 문제 : 카드2"}}},"pageContext":{"slug":"/posts/baekjoons/2164/"}}