format

fishercoder1534 · fishercoder1534 · commit 31b41037e9aa · 2017-07-26T19:06:27.000-07:00
diff --git a/README.md b/README.md
@@ -416,7 +416,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |158|[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_158.java)| O(n)|O(1) | Hard|
 |157|[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ReadNCharactersGivenRead4.java)| O(n)|O(1) | Easy| 
 |156|[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_156.java)| O(n)|O(h) | Medium| Tree, Recursion
-|155|[Min Stack](https://leetcode.com/problems/min-stack/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MinStack.java)| O(1)|O(n) | Easy| Stack
+|155|[Min Stack](https://leetcode.com/problems/min-stack/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_155.java)| O(1)|O(n) | Easy| Stack
 |154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_154.java)| O(logn)|O(1) | Hard| Array, Binary Search
 |153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_153.java)| O(logn)|O(1) | Medium| Array, Binary Search
 |152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MaximumProductSubarray.java)| O(n)|O(1) | Medium| Array
diff --git a/src/main/java/com/fishercoder/solutions/_155.java b/src/main/java/com/fishercoder/solutions/_155.java
@@ -9,7 +9,7 @@
  top() -- Get the top element.
  getMin() -- Retrieve the minimum element in the stack.
  Example:
- MinStack minStack = new MinStack();
+ _155 minStack = new _155();
  minStack.push(-2);
  minStack.push(0);
  minStack.push(-3);
@@ -18,13 +18,13 @@
  minStack.top();      --> Returns 0.
  minStack.getMin();   --> Returns -2.
  */
-public class MinStack {
+public class _155 {
     
     private Stack<Integer> stack;
     private int min;
 
     /** initialize your data structure here. */
-    public MinStack() {
+    public _155() {
         stack = new Stack();
         min = Integer.MAX_VALUE;
     }
