LeetCode 0064  Minimum Path Sum
Contents
Minimum Path Sum
Desicription
Given a m x n grid filled with nonnegative 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 1:


Given the above grid map, return 7
. Because the path 1→3→1→1→1 minimizes the sum.
Solution

