|
10 | 10 |
|
11 | 11 | import static junit.framework.Assert.assertEquals;
|
12 | 12 |
|
13 |
| -/** |
14 |
| - * Created by fishercoder on 12/31/16. |
15 |
| - */ |
16 | 13 | public class _163Test {
|
17 | 14 |
|
18 |
| - private static _163 test; |
19 |
| - private static List<String> expected; |
20 |
| - private static List<String> actual; |
21 |
| - private static int lower; |
22 |
| - private static int upper; |
23 |
| - private static int[] nums; |
| 15 | + private static _163.Solution1 solution1; |
| 16 | + private static List<String> expected; |
| 17 | + private static List<String> actual; |
| 18 | + private static int[] nums; |
24 | 19 |
|
25 |
| - @BeforeClass |
26 |
| - public static void setup() { |
27 |
| - test = new _163(); |
28 |
| - expected = new ArrayList(); |
29 |
| - actual = new ArrayList(); |
30 |
| - } |
| 20 | + @BeforeClass |
| 21 | + public static void setup() { |
| 22 | + solution1 = new _163.Solution1(); |
| 23 | + expected = new ArrayList(); |
| 24 | + actual = new ArrayList(); |
| 25 | + } |
31 | 26 |
|
32 |
| - @Before |
33 |
| - public void setupForEachTest() { |
34 |
| - expected.clear(); |
35 |
| - actual.clear(); |
36 |
| - } |
| 27 | + @Before |
| 28 | + public void setupForEachTest() { |
| 29 | + expected.clear(); |
| 30 | + actual.clear(); |
| 31 | + } |
37 | 32 |
|
38 |
| - @Test |
39 |
| - public void test1() { |
| 33 | + @Test |
| 34 | + public void test1() { |
| 35 | + //solution1 case 1: should return ["0->2147483646"] |
| 36 | + nums = new int[] {2147483647}; |
| 37 | + expected.add("0->2147483646"); |
| 38 | + actual = solution1.findMissingRanges(nums, 0, 2147483647); |
| 39 | + assertEquals(expected, actual); |
| 40 | + } |
40 | 41 |
|
41 |
| - //test case 1: should return ["0->2147483646"] |
42 |
| - lower = 0; |
43 |
| - upper = 2147483647; |
44 |
| - nums = new int[]{2147483647}; |
45 |
| - expected.add("0->2147483646"); |
46 |
| - actual = test.findMissingRanges(nums, lower, upper); |
47 |
| - assertEquals(expected, actual); |
| 42 | + @Test |
| 43 | + public void test2() { |
| 44 | + //solution1 case 2: should return ["-2147483647->-1","1->2147483646"] |
| 45 | + nums = new int[] {-2147483648, -2147483648, 0, 2147483647, 2147483647}; |
| 46 | + expected.add("-2147483647->-1"); |
| 47 | + expected.add("1->2147483646"); |
| 48 | + actual = solution1.findMissingRanges(nums, -2147483648, 2147483647); |
| 49 | + assertEquals(expected, actual); |
| 50 | + } |
48 | 51 |
|
49 |
| - } |
| 52 | + @Test |
| 53 | + public void test3() { |
| 54 | + //solution1 case 3: should return ["-2147483648->2147483647"] |
| 55 | + nums = new int[] {}; |
| 56 | + expected.add("-2147483648->2147483647"); |
| 57 | + actual = solution1.findMissingRanges(nums, -2147483648, 2147483647); |
| 58 | + assertEquals(expected, actual); |
| 59 | + } |
50 | 60 |
|
51 |
| - @Test |
52 |
| - public void test2() { |
53 |
| - //test case 2: should return ["-2147483647->-1","1->2147483646"] |
54 |
| - lower = -2147483648; |
55 |
| - upper = 2147483647; |
56 |
| - nums = new int[]{-2147483648, -2147483648, 0, 2147483647, 2147483647}; |
57 |
| - expected.add("-2147483647->-1"); |
58 |
| - expected.add("1->2147483646"); |
59 |
| - actual = test.findMissingRanges(nums, lower, upper); |
60 |
| - assertEquals(expected, actual); |
61 |
| - } |
| 61 | + @Test |
| 62 | + public void test4() { |
| 63 | + //solution1 case 4: should return ["-2147483648->2147483646"] |
| 64 | + nums = new int[] {2147483647}; |
| 65 | + expected.add("-2147483648->2147483646"); |
| 66 | + actual = solution1.findMissingRanges(nums, -2147483648, 2147483647); |
| 67 | + assertEquals(expected, actual); |
| 68 | + } |
62 | 69 |
|
63 |
| - @Test |
64 |
| - public void test3() { |
65 |
| - //test case 3: should return ["-2147483648->2147483647"] |
66 |
| - lower = -2147483648; |
67 |
| - upper = 2147483647; |
68 |
| - nums = new int[]{}; |
69 |
| - expected.add("-2147483648->2147483647"); |
70 |
| - actual = test.findMissingRanges(nums, lower, upper); |
71 |
| - assertEquals(expected, actual); |
72 |
| - } |
| 70 | + @Test |
| 71 | + public void test5() { |
| 72 | + //solution1 case 5: should return ["0->2147483647"] |
| 73 | + nums = new int[] {}; |
| 74 | + expected.add("0->2147483647"); |
| 75 | + actual = solution1.findMissingRanges(nums, 0, 2147483647); |
| 76 | + assertEquals(expected, actual); |
| 77 | + } |
73 | 78 |
|
74 |
| - @Test |
75 |
| - public void test4() { |
76 |
| - //test case 4: should return ["-2147483648->2147483646"] |
77 |
| - lower = -2147483648; |
78 |
| - upper = 2147483647; |
79 |
| - nums = new int[]{2147483647}; |
80 |
| - expected.add("-2147483648->2147483646"); |
81 |
| - actual = test.findMissingRanges(nums, lower, upper); |
82 |
| - assertEquals(expected, actual); |
83 |
| - } |
84 |
| - |
85 |
| - @Test |
86 |
| - public void test5() { |
87 |
| - //test case 5: should return ["0->2147483647"] |
88 |
| - lower = 0; |
89 |
| - upper = 2147483647; |
90 |
| - nums = new int[]{}; |
91 |
| - expected.add("0->2147483647"); |
92 |
| - actual = test.findMissingRanges(nums, lower, upper); |
93 |
| - assertEquals(expected, actual); |
94 |
| - } |
95 |
| - |
96 |
| - @Test |
97 |
| - public void test6() { |
98 |
| - //test case 6: should return ["-2147483647->2147483647"] |
99 |
| - lower = -2147483648; |
100 |
| - upper = 2147483647; |
101 |
| - nums = new int[]{-2147483648}; |
102 |
| - expected.add("-2147483647->2147483647"); |
103 |
| - actual = test.findMissingRanges(nums, lower, upper); |
104 |
| - assertEquals(expected, actual); |
105 |
| - } |
| 79 | + @Test |
| 80 | + public void test6() { |
| 81 | + //solution1 case 6: should return ["-2147483647->2147483647"] |
| 82 | + nums = new int[] {-2147483648}; |
| 83 | + expected.add("-2147483647->2147483647"); |
| 84 | + actual = solution1.findMissingRanges(nums, -2147483648, 2147483647); |
| 85 | + assertEquals(expected, actual); |
| 86 | + } |
106 | 87 | }
|
0 commit comments