60. Minimum Path Sum

MediumDynamic Programming

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.

Examples

Input: [[1,3,1],[1,5,1],[4,2,1]]

Output: 7

Explanation: The path 1→3→1→1→1 minimizes the sum to 7.

Constraints

  • m == grid.length
  • n == grid[i].length
  • 1 <= m, n <= 200
  • 0 <= grid[i][j] <= 200
Loading...

Run checks all cases above. Submit evaluates all test cases.