【LeetCode】解题64：Minimum Path Sum

Problem 64: Minimum Path Sum [Medium]

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.

Example:

Input:
[
[1,3,1],
[1,5,1],
[4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.

来源：LeetCode

解题思路

动态规划题，解题思路与Problem 62 Unique Paths类似。

状态方程：
s u m [ i , j ] = min ⁡ { s u m [ i , j − 1 ] , s u m [ i − 1 , j ] } + g r i d [ i , j ] sum[i, j] = \min\{sum[i, j-1], sum[i-1, j]\} + grid[i, j]