edit 536

fishercoder1534 · fishercoder1534 · commit ab47ac5eeb43 · 2017-07-24T13:33:46.000-07:00
diff --git a/README.md b/README.md
@@ -88,7 +88,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |539|[Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MinimumTimeDifference.java) | O(n) |O(1) | Medium | String
 |538|[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_538.java) | O(nlogn) |O(n) | Medium | Tree
 |537|[Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_537.java) | O(1) |O(1) | Medium | Math, String
-|536|[Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ConstructBinaryTreefromString.java) | O(n) |O(h) | Medium | Recursion
+|536|[Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_536.java) | O(n) |O(h) | Medium | Recursion
 |535|[Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_535.java) | O(1) |O(n) | Medium | Design
 |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/KdiffPairsinanArray.java) | O(n) |O(n) | Easy | HashMap
diff --git a/src/main/java/com/fishercoder/solutions/_536.java b/src/main/java/com/fishercoder/solutions/_536.java
@@ -22,7 +22,7 @@
  There will only be '(', ')', '-' and '0' ~ '9' in the input string.
  An empty tree is represented by "" instead of "()".
  */
-public class ConstructBinaryTreefromString {
+public class _536 {
 
     public TreeNode str2tree(String s) {
         if (s.equals("")) return null;
diff --git a/src/test/java/com/fishercoder/_536Test.java b/src/test/java/com/fishercoder/_536Test.java
@@ -1,22 +1,22 @@
 package com.fishercoder;
 
 import com.fishercoder.common.classes.TreeNode;
-import com.fishercoder.solutions.ConstructBinaryTreefromString;
+import com.fishercoder.solutions._536;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class ConstructBinaryTreefromStringTest {
-    private static ConstructBinaryTreefromString test;
+public class _536Test {
+    private static _536 test;
     private static TreeNode expected;
     private static TreeNode actual;
     private static String s;
 
     @BeforeClass
     public static void setup(){
-        test = new ConstructBinaryTreefromString();
+        test = new _536();
     }
 
     @Before
