Added unit tests 111-115.

Author: javadev

src.save/test/java/g0101_0200/s0111_minimum_depth_of_binary_tree/SolutionTest.java

@@ -4,18 +4,21 @@
 import static org.hamcrest.MatcherAssert.assertThat;
 
 import com_github_leetcode.TreeNode;
+import com_github_leetcode.TreeUtils;
+import java.util.Arrays;
 import org.junit.jupiter.api.Test;
 
 class SolutionTest {
  @Test
  void minDepth() {
- TreeNode bottomLeft = new TreeNode(15);
- TreeNode bottomRight = new TreeNode(7);
-
- TreeNode upRight = new TreeNode(20, bottomLeft, bottomRight);
- TreeNode upLeft = new TreeNode(9);
- TreeNode root = new TreeNode(3, upLeft, upRight);
-
+ TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(3, 9, 20, null, null, 15, 7));
  assertThat(new Solution().minDepth(root), equalTo(2));
  }
+
+ @Test
+ void minDepth2() {
+ TreeNode root =
+ TreeUtils.constructBinaryTree(Arrays.asList(2, null, 3, null, 4, null, 5, null, 6));
+ assertThat(new Solution().minDepth(root), equalTo(5));
+ }
 }

src.save/test/java/g0101_0200/s0112_path_sum/SolutionTest.java

@@ -4,27 +4,27 @@
 import static org.hamcrest.MatcherAssert.assertThat;
 
 import com_github_leetcode.TreeNode;
+import com_github_leetcode.TreeUtils;
+import java.util.Arrays;
 import org.junit.jupiter.api.Test;
 
 class SolutionTest {
  @Test
- void pathSum() {
- TreeNode fourthLevelLeftMostLeft = new TreeNode(7);
- TreeNode fourthLevelLeftMostRight = new TreeNode(2);
-
- TreeNode thirtLevelLeftMostRoot =
- new TreeNode(11, fourthLevelLeftMostLeft, fourthLevelLeftMostRight);
-
- TreeNode secondLevelLeftMostRoot = new TreeNode(4, thirtLevelLeftMostRoot, null);
-
- TreeNode fourthLevelRightMostRight = new TreeNode(1);
- TreeNode thirdLevelRightRoot = new TreeNode(4, fourthLevelRightMostRight, null);
- TreeNode thirdLevelLeftRoot = new TreeNode(13);
-
- TreeNode secondLevelRightRoot = new TreeNode(8, thirdLevelLeftRoot, thirdLevelRightRoot);
+ void hasPathSum() {
+ TreeNode root =
+ TreeUtils.constructBinaryTree(
+ Arrays.asList(5, 4, 8, 11, null, 13, 4, 7, 2, null, null, null, 1));
+ assertThat(new Solution().hasPathSum(root, 22), equalTo(true));
+ }
 
- TreeNode root = new TreeNode(5, secondLevelLeftMostRoot, secondLevelRightRoot);
+ @Test
+ void hasPathSum2() {
+ TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 3));
+ assertThat(new Solution().hasPathSum(root, 22), equalTo(false));
+ }
 
- assertThat(new Solution().hasPathSum(root, 22), equalTo(true));
+ @Test
+ void hasPathSum3() {
+ assertThat(new Solution().hasPathSum(null, 0), equalTo(false));
  }
 }

src.save/test/java/g0101_0200/s0113_path_sum_ii/SolutionTest.java

@@ -5,31 +5,30 @@
 
 import com_github_leetcode.ArrayUtils;
 import com_github_leetcode.TreeNode;
+import com_github_leetcode.TreeUtils;
+import java.util.Arrays;
 import org.junit.jupiter.api.Test;
 
 class SolutionTest {
  @Test
  void pathSum() {
- TreeNode fourthLevelLeftMostLeft = new TreeNode(7);
- TreeNode fourthLevelLeftMostRight = new TreeNode(2);
-
- TreeNode thirtLevelLeftMostRoot =
- new TreeNode(11, fourthLevelLeftMostLeft, fourthLevelLeftMostRight);
-
- TreeNode secondLevelLeftMostRoot = new TreeNode(4, thirtLevelLeftMostRoot, null);
-
- TreeNode fourthLevelRightMostRight = new TreeNode(1);
- TreeNode fourthLevelRightMostLeft = new TreeNode(5);
-
- TreeNode thirdLevelRightRoot =
- new TreeNode(4, fourthLevelRightMostRight, fourthLevelRightMostLeft);
- TreeNode thirdLevelLeftRoot = new TreeNode(13);
-
- TreeNode secondLevelRightRoot = new TreeNode(8, thirdLevelLeftRoot, thirdLevelRightRoot);
-
- TreeNode root = new TreeNode(5, secondLevelLeftMostRoot, secondLevelRightRoot);
+ TreeNode root =
+ TreeUtils.constructBinaryTree(
+ Arrays.asList(5, 4, 8, 11, null, 13, 4, 7, 2, null, null, 5, 1));
  assertThat(
  new Solution().pathSum(root, 22),
  equalTo(ArrayUtils.getLists(new int[][] {{5, 4, 11, 2}, {5, 8, 4, 5}})));
  }
+
+ @Test
+ void pathSum2() {
+ TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 3));
+ assertThat(new Solution().pathSum(root, 5), equalTo(ArrayUtils.getLists(new int[][] {})));
+ }
+
+ @Test
+ void pathSum3() {
+ TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2));
+ assertThat(new Solution().pathSum(root, 0), equalTo(ArrayUtils.getLists(new int[][] {})));
+ }
 }

src.save/test/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list/SolutionTest.java

@@ -4,22 +4,23 @@
 import static org.hamcrest.MatcherAssert.assertThat;
 
 import com_github_leetcode.TreeNode;
+import com_github_leetcode.TreeUtils;
+import java.util.Arrays;
+import java.util.Collections;
 import org.junit.jupiter.api.Test;
 
 class SolutionTest {
  @Test
- void flattenBinaryTreetoLinkedList() {
- TreeNode leftMostLeft = new TreeNode(3);
- TreeNode leftMostRight = new TreeNode(4);
- TreeNode leftRoot = new TreeNode(2, leftMostLeft, leftMostRight);
-
- TreeNode rightMostRight = new TreeNode(6);
- TreeNode rightRoot = new TreeNode(5, null, rightMostRight);
-
- TreeNode root = new TreeNode(1, leftRoot, rightRoot);
-
+ void flatten() {
+ TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 5, 3, 4, null, 6));
  new Solution().flatten(root);
-
  assertThat(root.toString(), equalTo("1,null,2,null,3,null,4,null,5,null,6"));
  }
+
+ @Test
+ void flatten2() {
+ TreeNode root = TreeUtils.constructBinaryTree(Collections.singletonList(0));
+ new Solution().flatten(root);
+ assertThat(root.toString(), equalTo("0"));
+ }
 }

src.save/test/java/g0101_0200/s0115_distinct_subsequences/SolutionTest.java

@@ -7,7 +7,12 @@
 
 class SolutionTest {
  @Test
- void distinctSubsequences() {
+ void numDistinct() {
  assertThat(new Solution().numDistinct("rabbbit", "rabbit"), equalTo(3));
  }
+
+ @Test
+ void numDistinct2() {
+ assertThat(new Solution().numDistinct("babgbag", "bag"), equalTo(5));
+ }
 }