refactor 225

fishercoder1534 · fishercoder1534 · commit 5e073d4e1989 · 2018-10-03T07:31:14.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_225.java b/src/main/java/com/fishercoder/solutions/_225.java
@@ -2,12 +2,16 @@
 
 import java.util.LinkedList;
 import java.util.Queue;
-/**Implement the following operations of a stack using queues.
+/**
+ * 225. Implement Stack using Queues
+ *
+ * Implement the following operations of a stack using queues.
 
  push(x) -- Push element x onto stack.
  pop() -- Removes the element on top of the stack.
  top() -- Get the top element.
  empty() -- Return whether the stack is empty.
+
  Notes:
  You must use only standard operations of a queue -- which means only push to back, peek/pop from front, size, and is empty operations are valid.
  Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
@@ -16,31 +20,34 @@ You may assume that all operations are valid (for example, no pop or top operati
  The class name of the Java function had been updated to MyStack instead of Stack.*/
 
 public class _225 {
-    class MyStack {
 
-        Queue<Integer> q = new LinkedList();
+    public static class Solution1 {
+        class MyStack {
+
+            Queue<Integer> q = new LinkedList();
 
-        // Push element x onto stack.
-        public void push(int x) {
-            q.offer(x);
-            for (int i = 1; i < q.size(); i++) {
-                q.offer(q.remove());
+            // Push element x onto stack.
+            public void push(int x) {
+                q.offer(x);
+                for (int i = 1; i < q.size(); i++) {
+                    q.offer(q.remove());
+                }
             }
-        }
 
-        // Removes the element on top of the stack.
-        public void pop() {
-            q.poll();
-        }
+            // Removes the element on top of the stack.
+            public void pop() {
+                q.poll();
+            }
 
-        // Get the top element.
-        public int top() {
-            return q.peek();
-        }
+            // Get the top element.
+            public int top() {
+                return q.peek();
+            }
 
-        // Return whether the stack is empty.
-        public boolean empty() {
-            return q.isEmpty();
+            // Return whether the stack is empty.
+            public boolean empty() {
+                return q.isEmpty();
+            }
         }
     }
 }
