Skip to content

Commit 9f0f22f

Browse files
committed
Refactor provideTestCases method for improved readability by consolidating return statement
1 parent ecbd1c7 commit 9f0f22f

File tree

1 file changed

+1
-10
lines changed

1 file changed

+1
-10
lines changed

src/test/java/com/thealgorithms/dynamicprogramming/LongestIncreasingSubsequenceNLogNTest.java

+1-10
Original file line numberDiff line numberDiff line change
@@ -11,16 +11,7 @@
1111
public class LongestIncreasingSubsequenceNLogNTest {
1212

1313
private static Stream<Arguments> provideTestCases() {
14-
return Stream.of(
15-
Arguments.of(new int[]{10, 9, 2, 5, 3, 7, 101, 18}, 4),
16-
Arguments.of(new int[]{0, 1, 0, 3, 2, 3}, 4),
17-
Arguments.of(new int[]{7, 7, 7, 7, 7}, 1),
18-
Arguments.of(new int[]{1, 3, 5, 4, 7}, 4),
19-
Arguments.of(new int[]{}, 0),
20-
Arguments.of(new int[]{10}, 1),
21-
Arguments.of(new int[]{3, 10, 2, 1, 20}, 3),
22-
Arguments.of(new int[]{50, 3, 10, 7, 40, 80}, 4)
23-
);
14+
return Stream.of(Arguments.of(new int[]{10, 9, 2, 5, 3, 7, 101, 18}, 4), Arguments.of(new int[]{0, 1, 0, 3, 2, 3}, 4), Arguments.of(new int[]{7, 7, 7, 7, 7}, 1), Arguments.of(new int[]{1, 3, 5, 4, 7}, 4), Arguments.of(new int[]{}, 0), Arguments.of(new int[]{10}, 1), Arguments.of(new int[]{3, 10, 2, 1, 20}, 3), Arguments.of(new int[]{50, 3, 10, 7, 40, 80}, 4));
2415
}
2516

2617
@ParameterizedTest

0 commit comments

Comments
 (0)