refactor 1339

fishercoder1534 · fishercoder1534 · commit dcc27ed6369c · 2020-02-08T09:52:40.000-08:00
diff --git a/README.md b/README.md
@@ -8,9 +8,9 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
-|1343|[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1343.java) | |Medium||
 |1342|[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1342.java) | |Easy|Bit Manipulation|
 |1341|[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1341.java) | |Easy||
+|1339|[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1339.java) | |Medium|DP, Tree|
 |1338|[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1338.java) | |Medium||
 |1337|[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1337.java) | |Easy|String|
 |1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1333.java) | |Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_1339.java b/src/main/java/com/fishercoder/solutions/_1339.java
@@ -6,7 +6,7 @@
 import java.util.Set;
 
 /**
- * 1343. Maximum Product of Splitted Binary Tree
+ * 1339. Maximum Product of Splitted Binary Tree
  *
  * Given a binary tree root. Split the binary tree into two subtrees by removing 1 edge such that the product of the sums of the subtrees are maximized.
  * Since the answer may be too large, return it modulo 10^9 + 7.
@@ -33,7 +33,7 @@
  * Each tree has at most 50000 nodes and at least 2 nodes.
  * Each node's value is between [1, 10000].
  * */
-public class _1343 {
+public class _1339 {
     public static class Solution1 {
         public int maxProduct(TreeNode root) {
             Set<Long> set = new HashSet<>();
diff --git a/src/test/java/com/fishercoder/_1339Test.java b/src/test/java/com/fishercoder/_1339Test.java
@@ -2,21 +2,21 @@
 
 import com.fishercoder.common.classes.TreeNode;
 import com.fishercoder.common.utils.TreeUtils;
-import com.fishercoder.solutions._1343;
+import com.fishercoder.solutions._1339;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import java.util.Arrays;
 
 import static org.junit.Assert.assertEquals;
 
-public class _1343Test {
-    private static _1343.Solution1 solution1;
+public class _1339Test {
+    private static _1339.Solution1 solution1;
     private static TreeNode root;
 
     @BeforeClass
     public static void setup() {
-        solution1 = new _1343.Solution1();
+        solution1 = new _1339.Solution1();
     }
 
     @Test
