《LeetCode力扣练习》第64题 最小路径和 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
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/minimum-path-sum
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。 -
超时的回溯法
/** * Created with IntelliJ IDEA. * * @author : DuZhenYang * @version : 2022.03.01 18:01:48 * description : */ public class LeetCode { private int result = Integer.MAX_VALUE; private int right = 1; private int down = 1; private int temp = 0; public int minPathSum(int[][] grid) { int m = grid.length; int n = grid[0].length; temp = grid[0][0]; backTrack(grid, m, n); return result; } private void backTrack(int[][] grid, int m, int n) { if (right == n && down == m) { result = Integer.min(result, temp); return; } if (right < n) { right++; temp += grid[down - 1][right - 1]; backTrack(grid, m, n); temp -= grid[down - 1][right - 1]; right--; } if (down < m) { down++; temp += grid[down - 1][right - 1]; backTrack(grid, m, n); temp -= grid[down - 1][right - 1]; down--; } } }
-
上代码(经过线上OJ测试)
/** * Created with IntelliJ IDEA. * * @author : DuZhenYang * @version : 2022.03.01 18:01:48 * description : */ public class LeetCode { public int minPathSum(int[][] grid) { int m = grid.length; int n = grid[0].length; int[][] result = new int[m][n]; result[0][0] = grid[0][0]; for (int i = 1; i < m; i++) { result[i][0] = grid[i][0] + result[i - 1][0]; } for (int i = 1; i < n; i++) { result[0][i] = grid[0][i] + result[0][i - 1]; } for (int row = 1; row < m; row++) { for (int col = 1; col < n; col++) { result[row][col] = Integer.min(result[row - 1][col], result[row][col - 1]) + grid[row][col]; } } return result[m - 1][n - 1]; } }