add 1305

fishercoder1534 · fishercoder1534 · commit 9bc8e4f6ef18 · 2019-12-29T08:40:07.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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java) | |Medium||
 |1304|[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java) | |Easy||
 |1302|[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java) | |Medium||
 |1300|[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1300.java) | |Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_1305.java b/src/main/java/com/fishercoder/solutions/_1305.java
@@ -0,0 +1,64 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.TreeNode;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+/**
+ * 1305. All Elements in Two Binary Search Trees
+ *
+ * Given two binary search trees root1 and root2.
+ * Return a list containing all the integers from both trees sorted in ascending order.
+ *
+ * Example 1:
+ * Input: root1 = [2,1,4], root2 = [1,0,3]
+ * Output: [0,1,1,2,3,4]
+ *
+ * Example 2:
+ * Input: root1 = [0,-10,10], root2 = [5,1,7,0,2]
+ * Output: [-10,0,0,1,2,5,7,10]
+ *
+ * Example 3:
+ * Input: root1 = [], root2 = [5,1,7,0,2]
+ * Output: [0,1,2,5,7]
+ *
+ * Example 4:
+ * Input: root1 = [0,-10,10], root2 = []
+ * Output: [-10,0,10]
+ *
+ * Example 5:
+ * Input: root1 = [1,null,8], root2 = [8,1]
+ * Output: [1,1,8,8]
+ *
+ * Constraints:
+ * Each tree has at most 5000 nodes.
+ * Each node's value is between [-10^5, 10^5].*/
+public class _1305 {
+    public static class Solution1 {
+        public List<Integer> getAllElements(TreeNode root1, TreeNode root2) {
+            List<Integer> list1 = getAllNodes(root1);
+            List<Integer> list2 = getAllNodes(root2);
+            List<Integer> merged = new ArrayList<>();
+            merged.addAll(list1);
+            merged.addAll(list2);
+            Collections.sort(merged);
+            return merged;
+        }
+
+        private List<Integer> getAllNodes(TreeNode root) {
+            List<Integer> list = new ArrayList<>();
+            return inorder(root, list);
+        }
+
+        List<Integer> inorder(TreeNode root, List<Integer> result) {
+            if (root == null) {
+                return result;
+            }
+            inorder(root.left, result);
+            result.add(root.val);
+            return inorder(root.right, result);
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1305Test.java b/src/test/java/com/fishercoder/_1305Test.java
@@ -0,0 +1,30 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.TreeUtils;
+import com.fishercoder.solutions._1305;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1305Test {
+    private static _1305.Solution1 solution1;
+    private static TreeNode root1;
+    private static TreeNode root2;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1305.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        root1 = TreeUtils.constructBinaryTree(Arrays.asList(2, 1, 4));
+        root2 = TreeUtils.constructBinaryTree(Arrays.asList(1, 0, 3));
+        assertEquals(Arrays.asList(0, 1, 1, 2, 3, 4), solution1.getAllElements(root1, root2));
+    }
+
+}
