此题不难,可以用dfs来做,也可以用动态规划,但明显dfs性能不如dp。
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.
动态规划:用dis[x][y]表示到达(x,y)的最短距离,因为只能向右和向下,所以dis(x,y) = dis[x-1][y]和dis[x][y-1]的较小值加上A(x,y)即可。最终所求转化为dis(m-1,n-1)
class Solution {
public:
int minPathSum(vect