Update implement-queue-using-stacks.cpp

Author: kamyu104

C++/implement-queue-using-stacks.cpp

@@ -1,20 +1,23 @@
 // Time:  O(1), amortized
 // Space: O(n)
 
-class Queue {
+class MyQueue {
 public:
-    // Push element x to the back of queue.
+    MyQueue() {
+        
+    }
+    
     void push(int x) {
         A_.emplace(x);
     }
 
-    // Removes the element from in front of queue.
-    void pop(void) {
+    int pop(void) {
         peek();
+        int result = B_.top();
         B_.pop();
+        return result;
     }
 
-    // Get the front element.
     int peek(void) {
         if (B_.empty()) {
           // Transfers the elements in A_ to B_.
@@ -29,11 +32,10 @@ class Queue {
         return B_.top();
     }
 
-    // Return whether the queue is empty.
     bool empty(void) {
         return A_.empty() && B_.empty();
     }
 
  private:
-  stack<int> A_, B_;
+    stack<int> A_, B_;
 };