Skip to content

Commit 04c70f8

Browse files
committed
Refactor provideTestCases method for improved formatting and readability
1 parent 059d7e5 commit 04c70f8

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

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

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,17 +1,17 @@
11
package com.thealgorithms.dynamicprogramming;
22

3-
import java.util.stream.Stream;
4-
53
import static org.junit.jupiter.api.Assertions.assertEquals;
64

5+
import java.util.stream.Stream;
76
import org.junit.jupiter.params.ParameterizedTest;
87
import org.junit.jupiter.params.provider.Arguments;
98
import org.junit.jupiter.params.provider.MethodSource;
109

1110
public class LongestIncreasingSubsequenceNLogNTest {
1211

1312
private static Stream<Arguments> provideTestCases() {
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));
13+
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),
14+
Arguments.of(new int[] {3, 10, 2, 1, 20}, 3), Arguments.of(new int[] {50, 3, 10, 7, 40, 80}, 4));
1515
}
1616

1717
@ParameterizedTest

0 commit comments

Comments
 (0)