| English | 简体中文 |

64. 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.


Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.

Similar Questions