71 lines
1.9 KiB
Java
71 lines
1.9 KiB
Java
//给定一个包含非负整数的 m x n 网格 grid ，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。
|
||
//
|
||
// 说明：每次只能向下或者向右移动一步。
|
||
//
|
||
//
|
||
//
|
||
// 示例 1：
|
||
//
|
||
//
|
||
//输入：grid = [[1,3,1],[1,5,1],[4,2,1]]
|
||
//输出：7
|
||
//解释：因为路径 1→3→1→1→1 的总和最小。
|
||
//
|
||
//
|
||
// 示例 2：
|
||
//
|
||
//
|
||
//输入：grid = [[1,2,3],[4,5,6]]
|
||
//输出：12
|
||
//
|
||
//
|
||
//
|
||
//
|
||
// 提示：
|
||
//
|
||
//
|
||
// m == grid.length
|
||
// n == grid[i].length
|
||
// 1 <= m, n <= 200
|
||
// 0 <= grid[i][j] <= 100
|
||
//
|
||
// Related Topics 数组 动态规划 矩阵
|
||
// 👍 955 👎 0
|
||
|
||
package leetcode.editor.cn;
|
||
|
||
import com.code.leet.entiy.TwoArray;
|
||
|
||
//64:最小路径和
|
||
class MinimumPathSum {
|
||
public static void main(String[] args) {
|
||
//测试代码
|
||
Solution solution = new MinimumPathSum().new Solution();
|
||
TwoArray twoArray = new TwoArray("[[1,3,1],[1,5,1],[4,2,1]]", true);
|
||
System.out.println(solution.minPathSum(twoArray.getArr()));
|
||
}
|
||
|
||
//力扣代码
|
||
//leetcode submit region begin(Prohibit modification and deletion)
|
||
class Solution {
|
||
public int minPathSum(int[][] grid) {
|
||
int[][] dp = new int[grid.length][grid[0].length];
|
||
for (int i = 0; i < grid.length; i++) {
|
||
for (int j = 0; j < grid[0].length; j++) {
|
||
if (i > 0 && j > 0) {
|
||
dp[i][j] = grid[i][j] + Math.min(dp[i - 1][j], dp[i][j - 1]);
|
||
} else if (i > 0) {
|
||
dp[i][j] = grid[i][j] + dp[i - 1][j];
|
||
} else if (j > 0) {
|
||
dp[i][j] = grid[i][j] + dp[i][j - 1];
|
||
} else {
|
||
dp[i][j] = grid[i][j];
|
||
}
|
||
}
|
||
}
|
||
return dp[grid.length - 1][grid[0].length - 1];
|
||
}
|
||
}
|
||
//leetcode submit region end(Prohibit modification and deletion)
|
||
|
||
} |