sudha-bhargavi
diff --git a/‎Design/225_Implement_Stack_using_Queues.java
Copy file name to clipboard
+32Lines changed: 32 additions & 0 deletions b/‎Design/225_Implement_Stack_using_Queues.java
Copy file name to clipboard
+32Lines changed: 32 additions & 0 deletions
@@ -0,0 +1,32 @@
+class MyStack {
+    Queue<Integer> q;
+
+    /** Initialize your data structure here. */
+    public MyStack() {
+        q = new LinkedList<>();
+    }
+
+    /** Push element x onto stack. */
+    public void push(int x) {
+        q.offer(x);
+
+        for (int i = 0; i < q.size() - 1; i++) {
+            q.offer(q.poll());
+        }
+    }
+
+    /** Removes the element on top of the stack and returns that element. */
+    public int pop() {
+        return q.remove();
+    }
+
+    /** Get the top element. */
+    public int top() {
+        return q.peek();
+    }
+
+    /** Returns whether the stack is empty. */
+    public boolean empty() {
+        return q.isEmpty();
+    }
+}