refactor 155

fishercoder1534 · fishercoder1534 · commit 714d364d2a8e · 2018-05-15T06:50:26.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_155.java b/src/main/java/com/fishercoder/solutions/_155.java
@@ -1,6 +1,5 @@
 package com.fishercoder.solutions;
 
-
 import java.util.Stack;
 
 /**
@@ -25,47 +24,48 @@
 
 public class _155 {
 
-    public static class MinStack {
-        private Stack<Integer> stack;
-        private int min;
-
-        /**
-         * initialize your data structure here.
-         */
-        public MinStack() {
-            stack = new Stack();
-            min = Integer.MAX_VALUE;
-        }
+    public static class Solution1 {
+        class MinStack {
+            private Stack<Integer> stack;
+            private int min;
 
-        public void push(int x) {
-            /**All the trick happens here, we push the second minimum number onto the stack before we push the newer one,
-             * this way, when popping, we could always get the next minimum one in constant time.*/
-            if (x <= min) {
-                stack.push(min);
-                min = x;
+            /**
+             * initialize your data structure here.
+             */
+            public MinStack() {
+                stack = new Stack();
+                min = Integer.MAX_VALUE;
             }
-            stack.push(x);
-        }
 
-        public void pop() {
-            if (min == stack.peek()) {
-                stack.pop();
-                min = stack.pop();
-            } else {
-                stack.pop();
+            public void push(int x) {
+                /**All the trick happens here, we push the second minimum number onto the stack before we push the newer one,
+                 * this way, when popping, we could always get the next minimum one in constant time.*/
+                if (x <= min) {
+                    stack.push(min);
+                    min = x;
+                }
+                stack.push(x);
             }
-            if (stack.isEmpty()) {
-                min = Integer.MAX_VALUE;
+
+            public void pop() {
+                if (min == stack.peek()) {
+                    stack.pop();
+                    min = stack.pop();
+                } else {
+                    stack.pop();
+                }
+                if (stack.isEmpty()) {
+                    min = Integer.MAX_VALUE;
+                }
             }
-        }
 
-        public int top() {
-            return stack.peek();
-        }
+            public int top() {
+                return stack.peek();
+            }
 
-        public int getMin() {
-            return min;
+            public int getMin() {
+                return min;
+            }
         }
     }
-
 }
