Added tests for tasks 8-3548

Author: ThanhNIT

src/test/java/g0001_0100/s0008_string_to_integer_atoi/SolutionTest.java

@@ -30,4 +30,64 @@ void myAtoi4() {
     void myAtoi5() {
         assertThat(new Solution().myAtoi("-91283472332"), equalTo(-2147483648));
     }
+
+    @Test
+    void myAtoi6() {
+        assertThat(new Solution().myAtoi("123"), equalTo(123));
+    }
+
+    @Test
+    void myAtoi7() {
+        assertThat(new Solution().myAtoi("+456"), equalTo(456));
+    }
+
+    @Test
+    void myAtoi8() {
+        assertThat(new Solution().myAtoi("0000123"), equalTo(123));
+    }
+
+    @Test
+    void myAtoi9() {
+        assertThat(new Solution().myAtoi("2147483648"), equalTo(Integer.MAX_VALUE));
+    }
+
+    @Test
+    void myAtoi10() {
+        assertThat(new Solution().myAtoi("-2147483649"), equalTo(Integer.MIN_VALUE));
+    }
+
+    @Test
+    void myAtoi11() {
+        assertThat(new Solution().myAtoi(""), equalTo(0));
+    }
+
+    @Test
+    void myAtoi12() {
+        assertThat(new Solution().myAtoi("     "), equalTo(0));
+    }
+
+    @Test
+    void myAtoi13() {
+        assertThat(new Solution().myAtoi("+-2"), equalTo(0));
+    }
+
+    @Test
+    void myAtoi14() {
+        assertThat(new Solution().myAtoi("0"), equalTo(0));
+    }
+
+    @Test
+    void myAtoi15() {
+        assertThat(new Solution().myAtoi("-0"), equalTo(0));
+    }
+
+    @Test
+    void myAtoi16() {
+        assertThat(new Solution().myAtoi("words 123"), equalTo(0));
+    }
+
+    @Test
+    void myAtoi17() {
+        assertThat(new Solution().myAtoi("  0000000000012345678abc"), equalTo(12345678));
+    }
 }

src/test/java/g1101_1200/s1184_distance_between_bus_stops/SolutionTest.java

@@ -23,4 +23,38 @@ void distanceBetweenBusStops3() {
         assertThat(
                 new Solution().distanceBetweenBusStops(new int[] {1, 2, 3, 4}, 0, 3), equalTo(4));
     }
+
+    @Test
+    void distanceBetweenBusStops4() {
+        assertThat(
+                new Solution().distanceBetweenBusStops(new int[] {1, 2, 3, 4}, 3, 1), equalTo(5));
+    }
+
+    @Test
+    void distanceBetweenBusStops5() {
+        assertThat(
+                new Solution().distanceBetweenBusStops(new int[] {7, 1, 2, 3}, 1, 3), equalTo(3));
+    }
+
+    @Test
+    void distanceBetweenBusStops6() {
+        assertThat(
+                new Solution().distanceBetweenBusStops(new int[] {2, 2, 2, 2}, 1, 3), equalTo(4));
+    }
+
+    @Test
+    void distanceBetweenBusStops7() {
+        assertThat(new Solution().distanceBetweenBusStops(new int[] {5}, 0, 0), equalTo(0));
+    }
+
+    @Test
+    void distanceBetweenBusStops8() {
+        assertThat(new Solution().distanceBetweenBusStops(new int[] {3, 8}, 1, 0), equalTo(3));
+    }
+
+    @Test
+    void distanceBetweenBusStops9() {
+        assertThat(
+                new Solution().distanceBetweenBusStops(new int[] {1, 4, 6, 3}, 2, 1), equalTo(4));
+    }
 }

src/test/java/g1801_1900/s1882_process_tasks_using_servers/SolutionTest.java

@@ -20,4 +20,54 @@ void assignTasks2() {
                         .assignTasks(new int[] {5, 1, 4, 3, 2}, new int[] {2, 1, 2, 4, 5, 2, 1}),
                 equalTo(new int[] {1, 4, 1, 4, 1, 3, 2}));
     }
+
+    @Test
+    void assignTasks3() {
+        assertThat(
+                new Solution().assignTasks(new int[] {1}, new int[] {1, 2, 3}),
+                equalTo(new int[] {0, 0, 0}));
+    }
+
+    @Test
+    void assignTasks4() {
+        assertThat(
+                new Solution().assignTasks(new int[] {2, 2, 2}, new int[] {1, 2, 1, 2}),
+                equalTo(new int[] {0, 0, 1, 0}));
+    }
+
+    @Test
+    void assignTasks5() {
+        assertThat(
+                new Solution().assignTasks(new int[] {1, 2}, new int[] {1, 2, 3, 4}),
+                equalTo(new int[] {0, 0, 1, 0}));
+    }
+
+    @Test
+    void assignTasks6() {
+        assertThat(
+                new Solution().assignTasks(new int[] {1, 2, 3}, new int[] {}),
+                equalTo(new int[] {}));
+    }
+
+    @Test
+    void assignTasks7() {
+        assertThat(
+                new Solution().assignTasks(new int[] {3, 1, 4}, new int[] {5}),
+                equalTo(new int[] {1}));
+    }
+
+    @Test
+    void assignTasks8() {
+        assertThat(
+                new Solution().assignTasks(new int[] {1, 2}, new int[] {2, 2, 2}),
+                equalTo(new int[] {0, 1, 0}));
+    }
+
+    @Test
+    void assignTasks9() {
+        int[] servers = {5, 3, 1, 4, 2};
+        int[] tasks = {1, 3, 5, 7, 9, 11};
+        assertThat(
+                new Solution().assignTasks(servers, tasks), equalTo(new int[] {2, 2, 4, 1, 2, 3}));
+    }
 }

src/test/java/g2501_2600/s2600_k_items_with_the_maximum_sum/SolutionTest.java

@@ -15,4 +15,44 @@ void kItemsWithMaximumSum() {
     void kItemsWithMaximumSum2() {
         assertThat(new Solution().kItemsWithMaximumSum(3, 2, 0, 4), equalTo(3));
     }
+
+    @Test
+    void kItemsWithMaximumSum3() {
+        assertThat(new Solution().kItemsWithMaximumSum(5, 3, 2, 5), equalTo(5));
+    }
+
+    @Test
+    void kItemsWithMaximumSum4() {
+        assertThat(new Solution().kItemsWithMaximumSum(3, 4, 5, 7), equalTo(3));
+    }
+
+    @Test
+    void kItemsWithMaximumSum5() {
+        assertThat(new Solution().kItemsWithMaximumSum(3, 1, 5, 6), equalTo(1));
+    }
+
+    @Test
+    void kItemsWithMaximumSum6() {
+        assertThat(new Solution().kItemsWithMaximumSum(2, 1, 10, 13), equalTo(-8));
+    }
+
+    @Test
+    void kItemsWithMaximumSum7() {
+        assertThat(new Solution().kItemsWithMaximumSum(0, 5, 5, 3), equalTo(0));
+    }
+
+    @Test
+    void kItemsWithMaximumSum8() {
+        assertThat(new Solution().kItemsWithMaximumSum(2, 0, 5, 3), equalTo(1));
+    }
+
+    @Test
+    void kItemsWithMaximumSum9() {
+        assertThat(new Solution().kItemsWithMaximumSum(4, 3, 0, 6), equalTo(4));
+    }
+
+    @Test
+    void kItemsWithMaximumSum10() {
+        assertThat(new Solution().kItemsWithMaximumSum(5, 5, 5, 0), equalTo(0));
+    }
 }

src/test/java/g3501_3600/s3548_equal_sum_grid_partition_ii/SolutionTest.java

@@ -139,4 +139,61 @@ void canPartitionGrid23() {
                 new Solution().canPartitionGrid(new int[][] {{2, 2}, {2, 2}, {1, 1}}),
                 equalTo(true));
     }
+
+    @Test
+    void canPartitionGrid24() {
+        Solution solution = new Solution();
+        int[][] grid = {
+            {2, 1},
+            {1, 1}
+        };
+        assertThat(solution.canPartitionGrid(grid), equalTo(true));
+    }
+
+    @Test
+    void canPartitionGrid2325() {
+        Solution solution = new Solution();
+        int[][] grid = {{1}, {2}, {1}};
+        assertThat(solution.canPartitionGrid(grid), equalTo(true));
+    }
+
+    @Test
+    void canPartitionGrid26() {
+        Solution solution = new Solution();
+        int[][] grid = {
+            {1, 2},
+            {1, 1}
+        };
+        assertThat(solution.canPartitionGrid(grid), equalTo(true));
+    }
+
+    @Test
+    void canPartitionGrid27() {
+        Solution solution = new Solution();
+        int[][] grid = {
+            {1, 1, 2},
+            {1, 1, 1}
+        };
+        assertThat(solution.canPartitionGrid(grid), equalTo(true));
+    }
+
+    @Test
+    void canPartitionGrid28() {
+        Solution solution = new Solution();
+        int[][] grid = {
+            {1, 1},
+            {1, 1}
+        };
+        assertThat(solution.canPartitionGrid(grid), equalTo(true));
+    }
+
+    @Test
+    void canPartitionGrid29() {
+        Solution solution = new Solution();
+        int[][] grid = {
+            {1, 2},
+            {3, 4}
+        };
+        assertThat(solution.canPartitionGrid(grid), equalTo(true));
+    }
 }