题目链接:https://leetcode.com/problems/minimum-path-sum/
题目:
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.
解题思路:
本题具有 1、最优子结构 和 2、重叠子问题 两个特点,由此联想到动态规划。
动态规划两种解决方式:
1、带备忘的自顶向下(需要存储子问题的解,通常存储在数组或散列表中)
2、自底向上
一开始只使用普通的自顶向下(而非带备忘的自顶向下),由于重复对子问题进行求解而超时。通过学习别人的方法,采取了带备忘的自顶向下,将子问题的解存在数组中,免除了重复求解子问题。
参考链接:http://blog.csdn.net/linhuanmars/article/details/22257673
public class Solution {
public int minPathSum(int[][] grid) {
if(grid == null || grid.length == 0 || grid[0].length == 0)
return 0;
int columns = grid[0].length;
int row = grid.length;
int[] res = new int[columns];
res[0] = grid[0][0];
for(int i = 1; i < columns; i ++)
res[i] = res[i - 1] + grid[0][i];
for(int i = 1; i < row; i ++) {
for(int j = 0; j < columns; j ++) {
if(j == 0)
res[j] = res[j] + grid[i][j];
else
res[j] = Math.min(res[j - 1], res[j]) + grid[i][j];
}
}
return res[columns - 1];
}
}
61 / 61 test cases passed.
Status: Accepted
Runtime: 348 ms