Optimize MinimumPathSum (#4400)

This commit is contained in:
Manan Solanki
2023-09-25 19:55:16 +05:30
committed by GitHub
parent d6024f9cd4
commit 9d8a0f36cf
2 changed files with 35 additions and 35 deletions

View File

@ -1,6 +1,6 @@
package com.thealgorithms.dynamicprogramming;
import static org.junit.jupiter.api.Assertions.*;
import static org.junit.jupiter.api.Assertions.assertEquals;
import org.junit.jupiter.api.Test;
@ -41,4 +41,10 @@ public class MinimumPathSumTest {
int[][] grid = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}};
assertEquals(30, MinimumPathSum.minimumPathSum(grid));
}
@Test
public void testMinimumPathSumWithNegativeNumberGrid() {
int[][] grid = {{1, 3, 1}, {3, 4, 1}, {4, -3, 1}};
assertEquals(6, MinimumPathSum.minimumPathSum(grid));
}
}