/
NikolayIvkin
/
TheAlgorithms
Обзор
Документация
Войти
/
NikolayIvkin
/
TheAlgorithms
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
src/test/java/com/thealgorithms/dynamicprogramming/SubsetSumTest.java
24 строки
1 KB
Alex Klymenko
refactor: `SubsetSum` (#5432)
30 авг 2024, 10:55
Не верифицирован
30 авг 2024, 10:55
cd38531
Код
Авторство
О чём код?
package com.thealgorithms.dynamicprogramming; import static org.junit.jupiter.api.Assertions.assertEquals; import java.util.stream.Stream; import org.junit.jupiter.params.ParameterizedTest; import org.junit.jupiter.params.provider.MethodSource; class SubsetSumTest { record TestCase(int[] arr, int sum, boolean expected) { } @ParameterizedTest @MethodSource("provideTestCases") void testSubsetSum(TestCase testCase) { assertEquals(testCase.expected(), SubsetSum.subsetSum(testCase.arr(), testCase.sum())); } private static Stream<TestCase> provideTestCases() { return Stream.of(new TestCase(new int[] {50, 4, 10, 15, 34}, 64, true), new TestCase(new int[] {50, 4, 10, 15, 34}, 99, true), new TestCase(new int[] {50, 4, 10, 15, 34}, 5, false), new TestCase(new int[] {50, 4, 10, 15, 34}, 66, false), new TestCase(new int[] {}, 0, true), new TestCase(new int[] {1, 2, 3}, 6, true), new TestCase(new int[] {1, 2, 3}, 7, false), new TestCase(new int[] {3, 34, 4, 12, 5, 2}, 9, true)); } }