Skip to content

Commit c4facdc

Browse files
TonnyLTonnyL
committed
test: unit test for java
1 parent a98813a commit c4facdc

158 files changed

Lines changed: 2203 additions & 2379 deletions

File tree

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

‎Java/src/AddTwoNumbersTest.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
public class AddTwoNumbersTest {
55

66
@Test
7-
public void addTwoNumbers() {
7+
public void testAddTwoNumbers() {
88
AddTwoNumbers atn = new AddTwoNumbers();
99

1010
AddTwoNumbers.ListNode node0 = new AddTwoNumbers.ListNode(0);

‎Java/src/BinaryTreeInorderTraversalTest.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
public class BinaryTreeInorderTraversalTest {
88

99
@Test
10-
public void inorderTraversal() {
10+
public void testInorderTraversal() {
1111
BinaryTreeInorderTraversal b = new BinaryTreeInorderTraversal();
1212

1313
Assert.assertTrue(b.inorderTraversal(null).isEmpty());

‎Java/src/ClimbingStairs.java‎

Lines changed: 0 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -26,14 +26,4 @@ public int climbStairs(int n) {
2626
return results[n - 1];
2727
}
2828

29-
public static void main(String[] args) {
30-
ClimbingStairs cs = new ClimbingStairs();
31-
// Expected: 1
32-
System.out.println(cs.climbStairs(1));
33-
// Expected: 3
34-
System.out.println(cs.climbStairs(3));
35-
// Expected: 8
36-
System.out.println(cs.climbStairs(5));
37-
}
38-
3929
}

‎Java/src/ClimbingStairsTest.java‎

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
import org.junit.Assert;
2+
import org.junit.Test;
3+
4+
public class ClimbingStairsTest {
5+
6+
@Test
7+
public void testClimbStairs() {
8+
ClimbingStairs cs = new ClimbingStairs();
9+
10+
Assert.assertTrue(cs.climbStairs(1) == 1);
11+
12+
Assert.assertTrue(cs.climbStairs(3) == 3);
13+
14+
Assert.assertTrue(cs.climbStairs(5) == 8);
15+
}
16+
17+
}

‎Java/src/CombinationSum.java‎

Lines changed: 0 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -53,17 +53,4 @@ private void dfs(int[] candidates, int target, List<Integer> path, List<List<Int
5353
}
5454
}
5555

56-
public static void main(String[] args) {
57-
CombinationSum cs = new CombinationSum();
58-
59-
// Expected: [[7], [2, 2, 3]]
60-
System.out.println(cs.combinationSum(new int[]{2, 3, 6, 7}, 7));
61-
62-
// Expected: [[1, 1, 1]]
63-
System.out.println(cs.combinationSum(new int[]{1}, 3));
64-
65-
// Expected: [[1, 1, 1, 1], [1, 1, 2], [2, 2]]
66-
System.out.println(cs.combinationSum(new int[]{1, 2}, 4));
67-
}
68-
6956
}

‎Java/src/CombinationSumII.java‎

Lines changed: 0 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -60,17 +60,4 @@ private void dfs(int[] candidates, int target, List<Integer> path, List<List<Int
6060
}
6161
}
6262

63-
public static void main(String[] args) {
64-
CombinationSumII cs = new CombinationSumII();
65-
66-
// Expected: [[1, 7], [1, 2, 5], [2, 6], [1, 1, 6]]
67-
System.out.println(cs.combinationSum2(new int[]{10, 1, 2, 7, 6, 1, 5}, 8));
68-
69-
// Expected: []
70-
System.out.println(cs.combinationSum2(new int[]{1}, 2));
71-
72-
// Expected: [[1, 1, 2], [2, 2]]
73-
System.out.println(cs.combinationSum2(new int[]{1, 1, 2, 2}, 4));
74-
}
75-
7663
}

‎Java/src/CombinationSumIITest.java‎

Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
import org.junit.Assert;
2+
import org.junit.Test;
3+
4+
import java.util.Arrays;
5+
import java.util.HashSet;
6+
import java.util.List;
7+
import java.util.Set;
8+
9+
public class CombinationSumIITest {
10+
11+
@Test
12+
public void testCombinationSum2() {
13+
CombinationSumII cs = new CombinationSumII();
14+
15+
// Expected: [[1, 7], [1, 2, 5], [2, 6], [1, 1, 6]]
16+
List<List<Integer>> list0 = cs.combinationSum2(new int[]{10, 1, 2, 7, 6, 1, 5}, 8);
17+
Set<List<Integer>> set = new HashSet<>();
18+
set.add(Arrays.asList(1, 7));
19+
set.add(Arrays.asList(1, 2, 5));
20+
set.add(Arrays.asList(2, 6));
21+
set.add(Arrays.asList(1, 1, 6));
22+
Assert.assertTrue(list0.size() == 4);
23+
Assert.assertEquals(new HashSet<>(list0), set);
24+
25+
// Expected: []
26+
Assert.assertTrue(cs.combinationSum2(new int[]{1}, 2).isEmpty());
27+
28+
// Expected: [[1, 1, 2], [2, 2]]
29+
set.clear();
30+
List<List<Integer>> list1 = cs.combinationSum2(new int[]{1, 1, 2, 2}, 4);
31+
set.add(Arrays.asList(1, 1, 2));
32+
set.add(Arrays.asList(2, 2));
33+
Assert.assertTrue(list1.size() == 2);
34+
Assert.assertEquals(new HashSet<>(list1), set);
35+
}
36+
37+
}

‎Java/src/CombinationSumTest.java‎

Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,34 @@
1+
import org.junit.Assert;
2+
import org.junit.Test;
3+
4+
import java.util.*;
5+
6+
public class CombinationSumTest {
7+
8+
@Test
9+
public void testCombinationSum() {
10+
CombinationSum cs = new CombinationSum();
11+
12+
List<List<Integer>> list0 = cs.combinationSum(new int[]{2, 3, 6, 7}, 7);
13+
Set<List<Integer>> set = new HashSet<>();
14+
set.add(Collections.singletonList(7));
15+
set.add(Arrays.asList(2, 2, 3));
16+
Assert.assertTrue(list0.size() == 2);
17+
Assert.assertEquals(new HashSet<>(list0), set);
18+
19+
List<List<Integer>> list1 = cs.combinationSum(new int[]{1}, 3);
20+
set.clear();
21+
set.add(Arrays.asList(1, 1, 1));
22+
Assert.assertTrue(list1.size() == 1);
23+
Assert.assertEquals(new HashSet<>(list1), set);
24+
25+
List<List<Integer>> list2 = cs.combinationSum(new int[]{1, 2}, 4);
26+
set.clear();
27+
set.add(Arrays.asList(1, 1, 1, 1));
28+
set.add(Arrays.asList(1, 1, 2));
29+
set.add(Arrays.asList(2, 2));
30+
Assert.assertTrue(list2.size() == 3);
31+
Assert.assertEquals(new HashSet<>(list2), set);
32+
}
33+
34+
}

‎Java/src/Combinations.java‎

Lines changed: 0 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -73,20 +73,4 @@ public List<List<Integer>> combine(int n, int k) {
7373
return results;
7474
}*/
7575

76-
public static void main(String[] args) {
77-
Combinations c = new Combinations();
78-
79-
// Expected: []
80-
System.out.println(c.combine(2, 0));
81-
82-
// Expected: [[1], [2]]
83-
System.out.println(c.combine(2, 1));
84-
85-
// Expected: [[2,4], [3,4], [2,3], [1,2], [1,3], [1,4]]
86-
System.out.println(c.combine(4, 2));
87-
88-
// Expected: [[1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]]
89-
System.out.println(c.combine(4, 3));
90-
}
91-
9276
}

‎Java/src/CombinationsTest.java‎

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
1+
import org.junit.Assert;
2+
import org.junit.Test;
3+
4+
import java.util.*;
5+
6+
public class CombinationsTest {
7+
8+
@Test
9+
public void testCombine() {
10+
Combinations c = new Combinations();
11+
12+
Assert.assertTrue(c.combine(2, 0).isEmpty());
13+
14+
List<List<Integer>> list0 = c.combine(2, 1);
15+
Set<List<Integer>> tmp = new HashSet<>();
16+
tmp.add(Collections.singletonList(1));
17+
tmp.add(Collections.singletonList(2));
18+
Assert.assertTrue(list0.size() == 2);
19+
Assert.assertEquals(new HashSet<>(list0), tmp);
20+
21+
tmp.clear();
22+
List<List<Integer>> list1 = c.combine(4, 2);
23+
tmp.add(Arrays.asList(2, 4));
24+
tmp.add(Arrays.asList(3, 4));
25+
tmp.add(Arrays.asList(2, 3));
26+
tmp.add(Arrays.asList(1, 2));
27+
tmp.add(Arrays.asList(1, 3));
28+
tmp.add(Arrays.asList(1, 4));
29+
Assert.assertTrue(list1.size() == 6);
30+
Assert.assertEquals(new HashSet<>(list1), tmp);
31+
32+
tmp.clear();
33+
List<List<Integer>> list2 = c.combine(4, 3);
34+
tmp.add(Arrays.asList(1, 2, 3));
35+
tmp.add(Arrays.asList(1, 2, 4));
36+
tmp.add(Arrays.asList(1, 3, 4));
37+
tmp.add(Arrays.asList(2, 3, 4));
38+
Assert.assertTrue(list2.size() == 4);
39+
Assert.assertEquals(new HashSet<>(list2), tmp);
40+
}
41+
42+
}

0 commit comments

Comments
 (0)