Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 6daf2d3

Browse files
committed
Simplified unit tests.
1 parent c8b3a8b commit 6daf2d3

File tree

5 files changed

+29
-71
lines changed

5 files changed

+29
-71
lines changed

‎src/test/java/g0101_0200/s0102_binary_tree_level_order_traversal/SolutionTest.java

Lines changed: 5 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -3,28 +3,18 @@
33
import static org.hamcrest.CoreMatchers.equalTo;
44
import static org.hamcrest.MatcherAssert.assertThat;
55

6+
import com_github_leetcode.ArrayUtils;
67
import com_github_leetcode.TreeNode;
7-
import java.util.ArrayList;
8-
import java.util.Arrays;
9-
import java.util.List;
108
import org.junit.Test;
119

1210
public class SolutionTest {
1311
@Test
14-
public void binaryTreeLevelOrderTraversal() {
12+
public void levelOrder() {
1513
TreeNode left = new TreeNode(9, null, null);
1614
TreeNode right = new TreeNode(20, new TreeNode(15), new TreeNode(7));
1715
TreeNode root = new TreeNode(3, left, right);
18-
19-
List<List<Integer>> expected = new ArrayList<>();
20-
expected.add(Arrays.asList(3));
21-
expected.add(Arrays.asList(9, 20));
22-
expected.add(Arrays.asList(15, 7));
23-
24-
List<List<Integer>> actual = new Solution().levelOrder(root);
25-
26-
for (int i = 0; i < expected.size(); i++) {
27-
assertThat(actual.get(i), equalTo(expected.get(i)));
28-
}
16+
assertThat(
17+
new Solution().levelOrder(root),
18+
equalTo(ArrayUtils.getLists(new int[][] {{3}, {9, 20}, {15, 7}})));
2919
}
3020
}

‎src/test/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/SolutionTest.java

Lines changed: 5 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -3,28 +3,18 @@
33
import static org.hamcrest.CoreMatchers.equalTo;
44
import static org.hamcrest.MatcherAssert.assertThat;
55

6+
import com_github_leetcode.ArrayUtils;
67
import com_github_leetcode.TreeNode;
7-
import java.util.ArrayList;
8-
import java.util.Arrays;
9-
import java.util.List;
108
import org.junit.Test;
119

1210
public class SolutionTest {
1311
@Test
14-
public void binaryTreeZigzagLevelOrderTraversal() {
12+
public void zigzagLevelOrder() {
1513
TreeNode left = new TreeNode(9, null, null);
1614
TreeNode right = new TreeNode(20, new TreeNode(15), new TreeNode(7));
1715
TreeNode root = new TreeNode(3, left, right);
18-
19-
List<List<Integer>> expected = new ArrayList<>();
20-
expected.add(Arrays.asList(3));
21-
expected.add(Arrays.asList(20, 9));
22-
expected.add(Arrays.asList(15, 7));
23-
24-
List<List<Integer>> actual = new Solution().zigzagLevelOrder(root);
25-
26-
for (int i = 0; i < expected.size(); i++) {
27-
assertThat(actual.get(i), equalTo(expected.get(i)));
28-
}
16+
assertThat(
17+
new Solution().zigzagLevelOrder(root),
18+
equalTo(ArrayUtils.getLists(new int[][] {{3}, {20, 9}, {15, 7}})));
2919
}
3020
}

‎src/test/java/g0101_0200/s0107_binary_tree_level_order_traversal_ii/SolutionTest.java

Lines changed: 5 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -3,29 +3,20 @@
33
import static org.hamcrest.CoreMatchers.equalTo;
44
import static org.hamcrest.MatcherAssert.assertThat;
55

6+
import com_github_leetcode.ArrayUtils;
67
import com_github_leetcode.TreeNode;
7-
import java.util.ArrayList;
8-
import java.util.Arrays;
9-
import java.util.List;
108
import org.junit.Test;
119

1210
public class SolutionTest {
1311
@Test
14-
public void binaryTreeLevelOrderTraversalII() {
12+
public void levelOrderBottom() {
1513
TreeNode bottomLeft = new TreeNode(15);
1614
TreeNode bottomRight = new TreeNode(7);
1715
TreeNode upRight = new TreeNode(20, bottomLeft, bottomRight);
1816
TreeNode upLeft = new TreeNode(9);
1917
TreeNode root = new TreeNode(3, upLeft, upRight);
20-
21-
List<List<Integer>> actual = new Solution().levelOrderBottom(root);
22-
List<List<Integer>> expected = new ArrayList<>();
23-
expected.add(Arrays.asList(15, 7));
24-
expected.add(Arrays.asList(9, 20));
25-
expected.add(Arrays.asList(3));
26-
27-
for (int i = 0; i < expected.size(); i++) {
28-
assertThat(actual.get(i), equalTo(expected.get(i)));
29-
}
18+
assertThat(
19+
new Solution().levelOrderBottom(root),
20+
equalTo(ArrayUtils.getLists(new int[][] {{15, 7}, {9, 20}, {3}})));
3021
}
3122
}

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

Lines changed: 5 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -3,15 +3,13 @@
33
import static org.hamcrest.CoreMatchers.equalTo;
44
import static org.hamcrest.MatcherAssert.assertThat;
55

6+
import com_github_leetcode.ArrayUtils;
67
import com_github_leetcode.TreeNode;
7-
import java.util.ArrayList;
8-
import java.util.Arrays;
9-
import java.util.List;
108
import org.junit.Test;
119

1210
public class SolutionTest {
1311
@Test
14-
public void pathSumII() {
12+
public void pathSum() {
1513
TreeNode fourthLevelLeftMostLeft = new TreeNode(7);
1614
TreeNode fourthLevelLeftMostRight = new TreeNode(2);
1715

@@ -30,14 +28,8 @@ public void pathSumII() {
3028
TreeNode secondLevelRightRoot = new TreeNode(8, thirdLevelLeftRoot, thirdLevelRightRoot);
3129

3230
TreeNode root = new TreeNode(5, secondLevelLeftMostRoot, secondLevelRightRoot);
33-
34-
List<List<Integer>> actual = new Solution().pathSum(root, 22);
35-
List<List<Integer>> expected = new ArrayList<>();
36-
expected.add(Arrays.asList(5, 4, 11, 2));
37-
expected.add(Arrays.asList(5, 8, 4, 5));
38-
39-
for (int i = 0; i < actual.size(); i++) {
40-
assertThat(actual.get(i), equalTo(expected.get(i)));
41-
}
31+
assertThat(
32+
new Solution().pathSum(root, 22),
33+
equalTo(ArrayUtils.getLists(new int[][] {{5, 4, 11, 2}, {5, 8, 4, 5}})));
4234
}
4335
}

‎src/test/java/g0101_0200/s0118_pascals_triangle/SolutionTest.java

Lines changed: 9 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -3,23 +3,18 @@
33
import static org.hamcrest.CoreMatchers.equalTo;
44
import static org.hamcrest.MatcherAssert.assertThat;
55

6-
import java.util.ArrayList;
7-
import java.util.Arrays;
8-
import java.util.List;
6+
import com_github_leetcode.ArrayUtils;
97
import org.junit.Test;
108

119
public class SolutionTest {
1210
@Test
13-
public void pascalTringle() {
14-
List<List<Integer>> actual = new Solution().generate(5);
15-
List<List<Integer>> expected = new ArrayList<>();
16-
expected.add(Arrays.asList(1));
17-
expected.add(Arrays.asList(1, 1));
18-
expected.add(Arrays.asList(1, 2, 1));
19-
expected.add(Arrays.asList(1, 3, 3, 1));
20-
expected.add(Arrays.asList(1, 4, 6, 4, 1));
21-
for (int i = 0; i < expected.size(); i++) {
22-
assertThat(actual.get(i), equalTo(expected.get(i)));
23-
}
11+
public void generate() {
12+
assertThat(
13+
new Solution().generate(5),
14+
equalTo(
15+
ArrayUtils.getLists(
16+
new int[][] {
17+
{1}, {1, 1}, {1, 2, 1}, {1, 3, 3, 1}, {1, 4, 6, 4, 1}
18+
})));
2419
}
2520
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /