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.
和62. Unique Paths的解题思路一样。
见程序注释
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
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.
和62. Unique Paths的解题思路一样。
见程序注释