edit 549

fishercoder1534 · fishercoder1534 · commit 6876ab091eee · 2017-07-08T18:01:56.000-07:00
diff --git a/README.md b/README.md
@@ -65,7 +65,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |553|[Optimal Division](https://leetcode.com/problems/optimal-division/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_553.java) | O(n) | O(n) | Medium | String
 |552|[Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_552.java) | O(n)| O(1) | Hard| DP
 |551|[Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_551.java) | O(n)| O(1) | Easy| String 
-|549|[Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/BinaryTreeLongestConsecutiveSequenceII.java) | O(n) |O(n) | Medium | Tree
+|549|[Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_549.java) | O(n) |O(n) | Medium | Tree
 |548|[Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_548.java) | O(n^2) |O(1) | Medium | Array
 |547|[Friend Circles](https://leetcode.com/problems/friend-circles/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FriendCircles.java) | O(n^2) |O(n) | Medium | Union Find
 |546|[Remove Boxes](https://leetcode.com/problems/remove-boxes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_546.java) | O(n^3) |O(n^3) | Hard| DFS, DP
diff --git a/src/main/java/com/fishercoder/solutions/_549.java b/src/main/java/com/fishercoder/solutions/_549.java
@@ -24,7 +24,7 @@
  Explanation: The longest consecutive path is [1, 2, 3] or [3, 2, 1].
  Note: All the values of tree nodes are in the range of [-1e7, 1e7].
  */
-public class BinaryTreeLongestConsecutiveSequenceII {
+public class _549 {
 
     int max = 0;
     public int longestConsecutive(TreeNode root) {
diff --git a/src/test/java/com/fishercoder/_549Test.java b/src/test/java/com/fishercoder/_549Test.java
@@ -1,23 +1,23 @@
 package com.fishercoder;
 
 import com.fishercoder.common.classes.TreeNode;
-import com.fishercoder.solutions.BinaryTreeLongestConsecutiveSequenceII;
+import com.fishercoder.solutions._549;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Ignore;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class BinaryTreeLongestConsecutiveSequenceIITest {
-    private static BinaryTreeLongestConsecutiveSequenceII test;
+public class _549Test {
+    private static _549 test;
     private static int expected;
     private static int actual;
     private static TreeNode root;
 
     @BeforeClass
     public static void setup(){
-        test = new BinaryTreeLongestConsecutiveSequenceII();
+        test = new _549();
     }
 
     @Before
