/
NikolayIvkin
/
TheAlgorithms
Обзор
Документация
Войти
/
NikolayIvkin
/
TheAlgorithms
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
src/test/java/com/thealgorithms/dynamicprogramming/KnapsackMemoizationTest.java
49 строк
1 KB
PANKAJ PATWAL
Optimize and Format Knapsack Memoization Algorithm (#5685)
12 окт 2024, 10:11
Не верифицирован
12 окт 2024, 10:11
e38611e
Код
Авторство
О чём код?
package com.thealgorithms.dynamicprogramming; import static org.junit.jupiter.api.Assertions.assertEquals; import org.junit.jupiter.api.Test; public class KnapsackMemoizationTest { KnapsackMemoization knapsackMemoization = new KnapsackMemoization(); @Test void test1() { int[] weight = {1, 3, 4, 5}; int[] value = {1, 4, 5, 7}; int capacity = 10; assertEquals(13, knapsackMemoization.knapSack(capacity, weight, value, weight.length)); } @Test void test2() { int[] weight = {95, 4, 60, 32, 23, 72, 80, 62, 65, 46}; int[] value = {55, 10, 47, 5, 4, 50, 8, 61, 85, 87}; int capacity = 269; assertEquals(295, knapsackMemoization.knapSack(capacity, weight, value, weight.length)); } @Test void test3() { int[] weight = {10, 20, 30}; int[] value = {60, 100, 120}; int capacity = 50; assertEquals(220, knapsackMemoization.knapSack(capacity, weight, value, weight.length)); } @Test void test4() { int[] weight = {1, 2, 3}; int[] value = {10, 20, 30}; int capacity = 0; assertEquals(0, knapsackMemoization.knapSack(capacity, weight, value, weight.length)); } @Test void test5() { int[] weight = {1, 2, 3, 8}; int[] value = {10, 20, 30, 40}; int capacity = 50; assertEquals(100, knapsackMemoization.knapSack(capacity, weight, value, weight.length)); } }