format

fishercoder1534 · fishercoder1534 · commit 14cbc9119a29 · 2017-07-26T19:02:46.000-07:00
diff --git a/README.md b/README.md
@@ -97,7 +97,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |533|[Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_533.java) | O(m*n) |O(m) (m is number of rows) | Medium | HashMap
 |532|[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_532.java) | O(n) |O(n) | Easy | HashMap
 |531|[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_531.java) | O(m*n) |O(1) | Medium | 
-|530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MinimumAbsoluteDifferenceinBST.java) | O(n) |O(n) | Easy| DFS
+|530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_530.java) | O(n) |O(n) | Easy| DFS
 |529|[Minesweeper](https://leetcode.com/problems/minesweeper/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_529.java) | O(m*n) |O(k) | Medium | BFS
 |526|[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_526.java) | O(n) |O(h) | Medium | Backtracking
 |525|[Contiguous Array](https://leetcode.com/problems/contiguous-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_525.java) | O(n) |O(n) | Medium | HashMap
diff --git a/src/main/java/com/fishercoder/solutions/_530.java b/src/main/java/com/fishercoder/solutions/_530.java
@@ -25,7 +25,7 @@
  The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).
  Note: There are at least two nodes in this BST.
  */
-public class MinimumAbsoluteDifferenceinBST {
+public class _530 {
 
     public int getMinimumDifference(TreeNode root) {
         TreeSet<Integer> treeset = new TreeSet<>();
diff --git a/src/test/java/com/fishercoder/_530Test.java b/src/test/java/com/fishercoder/_530Test.java
@@ -1,22 +1,22 @@
 package com.fishercoder;
 
 import com.fishercoder.common.classes.TreeNode;
-import com.fishercoder.solutions.MinimumAbsoluteDifferenceinBST;
+import com.fishercoder.solutions._530;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class MinimumAbsoluteDifferenceinBSTTest {
-    private static MinimumAbsoluteDifferenceinBST test;
+public class _530Test {
+    private static _530 test;
     private static int expected;
     private static int actual;
     private static TreeNode root;
 
     @BeforeClass
     public static void setup(){
-        test = new MinimumAbsoluteDifferenceinBST();
+        test = new _530();
     }
 
     @Before
