algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-27 06:23:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: format code (#4212)

Browse Source 
close #4204
This commit is contained in:
acbin
2023-06-09 18:52:05 +08:00
committed by GitHub
parent ad03086f54
commit 00282efd8b
521 changed files with 5233 additions and 7309 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/main/java/com/thealgorithms/dynamicprogramming/MinimumPathSum.java
View File

@ -28,22 +28,22 @@ For more information see https://www.geeksforgeeks.org/maximum-path-sum-matrix/
public class MinimumPathSum {
public void testRegular() {
int[][] grid = { { 1, 3, 1 }, { 1, 5, 1 }, { 4, 2, 1 } };
int[][] grid = {{1, 3, 1}, {1, 5, 1}, {4, 2, 1}};
System.out.println(minimumPathSum(grid));
}
public void testLessColumns() {
int[][] grid = { { 1, 2 }, { 5, 6 }, { 1, 1 } };
int[][] grid = {{1, 2}, {5, 6}, {1, 1}};
System.out.println(minimumPathSum(grid));
}
public void testLessRows() {
int[][] grid = { { 2, 3, 3 }, { 7, 2, 1 } };
int[][] grid = {{2, 3, 3}, {7, 2, 1}};
System.out.println(minimumPathSum(grid));
}
public void testOneRowOneColumn() {
int[][] grid = { { 2 } };
int[][] grid = {{2}};
System.out.println(minimumPathSum(grid));
}