add 1343

fishercoder1534 · fishercoder1534 · commit 4c6685fdb70d · 2020-02-02T08:09:30.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _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||
 |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||
 |1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | |Easy||
 |1329|[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1329.java) | |Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_1343.java b/src/main/java/com/fishercoder/solutions/_1343.java
@@ -0,0 +1,30 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.TreeNode;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _1343 {
+    public static class Solution1 {
+        public int maxProduct(TreeNode root) {
+            Set<Long> set = new HashSet<>();
+            int total = dfs(root, set);
+            long result = 0l;
+            for (long sum : set) {
+                result = Math.max(result, sum * (total - sum));
+            }
+            return (int) (result % 1000000007);
+        }
+
+        private int dfs(TreeNode root, Set<Long> set) {
+            if (root == null) {
+                return 0;
+            }
+            root.val += dfs(root.left, set);
+            root.val += dfs(root.right, set);
+            set.add((long) root.val);
+            return root.val;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1343Test.java b/src/test/java/com/fishercoder/_1343Test.java
@@ -0,0 +1,28 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.TreeUtils;
+import com.fishercoder.solutions._1343;
+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;
+    private static TreeNode root;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1343.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 3, 4, 5, 6));
+        assertEquals(110, solution1.maxProduct(root));
+    }
+
+}
