Simplified unit tests.

Author: javadev

src/test/java/g0001_0100/s0040_combination_sum_ii/SolutionTest.java

@@ -3,38 +3,15 @@
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
 
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.List;
+import com_github_leetcode.ArrayUtils;
 import org.junit.Test;
 
 public class SolutionTest {
     @Test
     public void combinationSum2() {
-        List<List<Integer>> expected = new ArrayList<>();
-
-        List<Integer> sub1 = new ArrayList<>();
-        sub1.addAll(Arrays.asList(1, 1, 6));
-
-        List<Integer> sub2 = new ArrayList<>();
-        sub2.addAll(Arrays.asList(1, 2, 5));
-
-        List<Integer> sub3 = new ArrayList<>();
-        sub3.addAll(Arrays.asList(1, 7));
-
-        List<Integer> sub4 = new ArrayList<>();
-        sub4.addAll(Arrays.asList(2, 6));
-
-        expected.add(sub1);
-        expected.add(sub2);
-        expected.add(sub3);
-        expected.add(sub4);
-
-        List<List<Integer>> actual =
-                new Solution().combinationSum2(new int[] {10, 1, 2, 7, 6, 1, 5}, 8);
-
-        for (int i = 0; i < expected.size(); i++) {
-            assertThat(actual.get(i).toArray(), equalTo(expected.get(i).toArray()));
-        }
+        int[][] expected = {{1, 1, 6}, {1, 2, 5}, {1, 7}, {2, 6}};
+        assertThat(
+                new Solution().combinationSum2(new int[] {10, 1, 2, 7, 6, 1, 5}, 8),
+                equalTo(ArrayUtils.getLists(expected)));
     }
 }

src/test/java/g0001_0100/s0046_permutations/SolutionTest.java

@@ -3,28 +3,15 @@
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
 
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.List;
+import com_github_leetcode.ArrayUtils;
 import org.junit.Test;
 
 public class SolutionTest {
     @Test
-    public void permutations() {
-        List<List<Integer>> expected = new ArrayList<>();
-        expected.add(Arrays.asList(1, 2, 3));
-        expected.add(Arrays.asList(1, 3, 2));
-        expected.add(Arrays.asList(2, 1, 3));
-        expected.add(Arrays.asList(2, 3, 1));
-        expected.add(Arrays.asList(3, 1, 2));
-        expected.add(Arrays.asList(3, 2, 1));
-
-        List<List<Integer>> actual = new Solution().permute(new int[] {1, 2, 3});
-
-        for (int i = 0; i < expected.size(); i++) {
-            assertThat(
-                    Arrays.toString(actual.get(i).toArray()),
-                    equalTo(Arrays.toString(expected.get(i).toArray())));
-        }
+    public void permute() {
+        int[][] expected = {{1, 2, 3}, {1, 3, 2}, {2, 1, 3}, {2, 3, 1}, {3, 1, 2}, {3, 2, 1}};
+        assertThat(
+                new Solution().permute(new int[] {1, 2, 3}),
+                equalTo(ArrayUtils.getLists(expected)));
     }
 }

src/test/java/g0001_0100/s0047_permutations_ii/SolutionTest.java

@@ -3,25 +3,15 @@
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
 
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.List;
+import com_github_leetcode.ArrayUtils;
 import org.junit.Test;
 
 public class SolutionTest {
     @Test
     public void permuteUnique() {
-        List<List<Integer>> expected = new ArrayList<>();
-        expected.add(Arrays.asList(1, 1, 2));
-        expected.add(Arrays.asList(1, 2, 1));
-        expected.add(Arrays.asList(2, 1, 1));
-
-        List<List<Integer>> actual = new Solution().permuteUnique(new int[] {1, 1, 2});
-
-        for (int i = 0; i < expected.size(); i++) {
-            assertThat(
-                    Arrays.toString(actual.get(i).toArray()),
-                    equalTo(Arrays.toString(expected.get(i).toArray())));
-        }
+        int[][] expected = {{1, 1, 2}, {1, 2, 1}, {2, 1, 1}};
+        assertThat(
+                new Solution().permuteUnique(new int[] {1, 1, 2}),
+                equalTo(ArrayUtils.getLists(expected)));
     }
 }

src/test/java/g0001_0100/s0048_rotate_image/SolutionTest.java

@@ -3,19 +3,16 @@
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.hamcrest.MatcherAssert.assertThat;
 
-import java.util.Arrays;
 import org.junit.Test;
 
 public class SolutionTest {
     @Test
-    public void rotateImage() {
+    public void rotate() {
         int[][] expected = new int[][] {{7, 4, 1}, {8, 5, 2}, {9, 6, 3}};
         int[][] input = new int[][] {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
 
         new Solution().rotate(input);
 
-        for (int i = 0; i < expected.length; i++) {
-            assertThat(Arrays.toString(input[i]), equalTo(Arrays.toString(expected[i])));
-        }
+        assertThat(input, equalTo(expected));
     }
 }

src/test/java/g0001_0100/s0056_merge_intervals/SolutionTest.java

@@ -12,8 +12,6 @@ public void mergeIntervals() {
         int[][] expected = {{1, 6}, {8, 10}, {15, 18}};
         int[][] actual = new Solution().merge(input);
 
-        for (int i = 0; i < expected.length; i++) {
-            assertThat(actual[i], equalTo(expected[i]));
-        }
+        assertThat(actual, equalTo(expected));
     }
 }

src/test/java/g0001_0100/s0057_insert_interval/SolutionTest.java

@@ -11,8 +11,6 @@ public void insertInterval() {
         int[][] expected = {{1, 5}, {6, 9}};
         int[][] actual = new Solution().insert(new int[][] {{1, 3}, {6, 9}}, new int[] {2, 5});
 
-        for (int i = 0; i < actual.length; i++) {
-            assertThat(actual[i], equalTo(expected[i]));
-        }
+        assertThat(actual, equalTo(expected));
     }
 }

src/test/java/g0001_0100/s0059_spiral_matrix_ii/SolutionTest.java

@@ -10,8 +10,6 @@ public class SolutionTest {
     public void generateMatrix() {
         int[][] actual = new Solution().generateMatrix(3);
         int[][] expected = {{1, 2, 3}, {8, 9, 4}, {7, 6, 5}};
-        for (int i = 0; i < expected.length; i++) {
-            assertThat(actual[i], equalTo(expected[i]));
-        }
+        assertThat(actual, equalTo(expected));
     }
 }

src/test/java/g0001_0100/s0063_unique_paths_ii/SolutionTest.java

@@ -9,9 +9,7 @@ public class SolutionTest {
     @Test
     public void uniquePathsWithObstacles() {
         int[][] expected = {
-            {
-                0, 0, 0,
-            },
+            {0, 0, 0},
             {0, 1, 0},
             {0, 0, 0}
         };

src/test/java/g0001_0100/s0068_text_justification/SolutionTest.java

@@ -9,7 +9,7 @@
 
 public class SolutionTest {
     @Test
-    public void textJustification() {
+    public void fullJustify() {
         String[] input =
                 new String[] {"This", "is", "an", "example", "of", "text", "justification."};
         List<String> actual = new Solution().fullJustify(input, 16);
@@ -19,8 +19,6 @@ public void textJustification() {
         expected.add("example  of text");
         expected.add("justification.  ");
 
-        for (int i = 0; i < expected.size(); i++) {
-            assertThat(actual.get(i), equalTo(expected.get(i)));
-        }
+        assertThat(actual, equalTo(expected));
     }
 }

src/test/java/g0001_0100/s0070_climbing_stairs/SolutionTest.java

@@ -6,7 +6,6 @@
 import org.junit.Test;
 
 public class SolutionTest {
-
     @Test
     public void climbStairs() {
         assertThat(new Solution().climbStairs(2), equalTo(2));