mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-07 17:56:02 +08:00
@ -10,29 +10,20 @@ public class CombinationTest {
|
||||
|
||||
@Test
|
||||
void testNoElement() {
|
||||
List<TreeSet<Integer>> result = Combination.combination(
|
||||
new Integer[] { 1, 2 },
|
||||
0
|
||||
);
|
||||
List<TreeSet<Integer>> result = Combination.combination(new Integer[] {1, 2}, 0);
|
||||
assertTrue(result == null);
|
||||
}
|
||||
|
||||
@Test
|
||||
void testLengthOne() {
|
||||
List<TreeSet<Integer>> result = Combination.combination(
|
||||
new Integer[] { 1, 2 },
|
||||
1
|
||||
);
|
||||
List<TreeSet<Integer>> result = Combination.combination(new Integer[] {1, 2}, 1);
|
||||
assertTrue(result.get(0).iterator().next() == 1);
|
||||
assertTrue(result.get(1).iterator().next() == 2);
|
||||
}
|
||||
|
||||
@Test
|
||||
void testLengthTwo() {
|
||||
List<TreeSet<Integer>> result = Combination.combination(
|
||||
new Integer[] { 1, 2 },
|
||||
2
|
||||
);
|
||||
List<TreeSet<Integer>> result = Combination.combination(new Integer[] {1, 2}, 2);
|
||||
Integer[] arr = result.get(0).toArray(new Integer[2]);
|
||||
assertTrue(arr[0] == 1);
|
||||
assertTrue(arr[1] == 2);
|
||||
|
Reference in New Issue
Block a user