From 16ca7114ff1847d0f66d5fbe98cd4c591187568f Mon Sep 17 00:00:00 2001 From: ThanhNIT Date: Sun, 16 Nov 2025 14:56:25 +0700 Subject: [PATCH 1/2] Added tests for tasks 8-3548 --- .../SolutionTest.java | 60 +++++++++++++++++++ .../SolutionTest.java | 34 +++++++++++ .../SolutionTest.java | 50 ++++++++++++++++ .../SolutionTest.java | 40 +++++++++++++ .../SolutionTest.java | 57 ++++++++++++++++++ 5 files changed, 241 insertions(+) diff --git a/src/test/java/g0001_0100/s0008_string_to_integer_atoi/SolutionTest.java b/src/test/java/g0001_0100/s0008_string_to_integer_atoi/SolutionTest.java index 23df3d4e9..9e9094e6d 100644 --- a/src/test/java/g0001_0100/s0008_string_to_integer_atoi/SolutionTest.java +++ b/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)); + } } diff --git a/src/test/java/g1101_1200/s1184_distance_between_bus_stops/SolutionTest.java b/src/test/java/g1101_1200/s1184_distance_between_bus_stops/SolutionTest.java index 45bb554fb..30a080334 100644 --- a/src/test/java/g1101_1200/s1184_distance_between_bus_stops/SolutionTest.java +++ b/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)); + } } diff --git a/src/test/java/g1801_1900/s1882_process_tasks_using_servers/SolutionTest.java b/src/test/java/g1801_1900/s1882_process_tasks_using_servers/SolutionTest.java index f704b3df4..a9deb9015 100644 --- a/src/test/java/g1801_1900/s1882_process_tasks_using_servers/SolutionTest.java +++ b/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})); + } } diff --git a/src/test/java/g2501_2600/s2600_k_items_with_the_maximum_sum/SolutionTest.java b/src/test/java/g2501_2600/s2600_k_items_with_the_maximum_sum/SolutionTest.java index f735049b8..4e7e99e43 100644 --- a/src/test/java/g2501_2600/s2600_k_items_with_the_maximum_sum/SolutionTest.java +++ b/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(2)); + } + + @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)); + } } diff --git a/src/test/java/g3501_3600/s3548_equal_sum_grid_partition_ii/SolutionTest.java b/src/test/java/g3501_3600/s3548_equal_sum_grid_partition_ii/SolutionTest.java index a80e0c66f..c004147b2 100644 --- a/src/test/java/g3501_3600/s3548_equal_sum_grid_partition_ii/SolutionTest.java +++ b/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)); + } } From b6c9a2be187db38b0d38150592e0ba9ba160f1d6 Mon Sep 17 00:00:00 2001 From: ThanhNIT Date: Tue, 18 Nov 2025 23:01:48 +0700 Subject: [PATCH 2/2] Update SolutionTest.java --- .../s2600_k_items_with_the_maximum_sum/SolutionTest.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/test/java/g2501_2600/s2600_k_items_with_the_maximum_sum/SolutionTest.java b/src/test/java/g2501_2600/s2600_k_items_with_the_maximum_sum/SolutionTest.java index 4e7e99e43..924f93ffb 100644 --- a/src/test/java/g2501_2600/s2600_k_items_with_the_maximum_sum/SolutionTest.java +++ b/src/test/java/g2501_2600/s2600_k_items_with_the_maximum_sum/SolutionTest.java @@ -28,7 +28,7 @@ void kItemsWithMaximumSum4() { @Test void kItemsWithMaximumSum5() { - assertThat(new Solution().kItemsWithMaximumSum(3, 1, 5, 6), equalTo(2)); + assertThat(new Solution().kItemsWithMaximumSum(3, 1, 5, 6), equalTo(1)); } @Test