implement_stack_using_queues

hitzzc · hitzzc · commit 4945e38d3d9c · 2016-10-17T18:08:34.000+08:00
diff --git a/README.md b/README.md
@@ -181,6 +181,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [222. Count Complete Tree Nodes](https://github.com/hitzzc/go-leetcode/tree/master/count_complete_tree_nodes)
 #### [223. Rectangle Area](https://github.com/hitzzc/go-leetcode/tree/master/rectangle_area)
 #### [224. Basic Calculator](https://github.com/hitzzc/go-leetcode/tree/master/basic_calculator)
+#### [225. Implement Stack using Queues](https://github.com/hitzzc/go-leetcode/tree/master/implement_stack_using_queues)
 
 
 
diff --git a/implement_stack_using_queues/implement_stack_using_queues.cpp b/implement_stack_using_queues/implement_stack_using_queues.cpp
@@ -0,0 +1,30 @@
+#include <queue>
+
+class Stack {
+public:
+    queue<int> q;
+    // Push element x onto stack.
+    void push(int x) {
+        q.push(x);
+    }
+
+    // Removes the element on top of the stack.
+    void pop() {
+        int num = q.size() - 1;
+        while (num-- > 0){
+            q.push(q.front());
+            q.pop();
+        }
+        q.pop();
+    }
+
+    // Get the top element.
+    int top() {
+        return q.back();
+    }
+
+    // Return whether the stack is empty.
+    bool empty() {
+        return q.empty();
+    }
+};
