207. Minimum Path Sum
Medium•
Given a rectangular grid of nonnegative integers, return the smallest sum of cell values along a route from the top-left to the bottom-right. You may move only right or down, and both endpoint values count.
You may reuse grid to store intermediate results; preserving the original values is not required. Return the minimum sum as a number.
Example 1:
Input: grid = [[1,3,1],[1,5,1],[4,2,1]]
Output: 7
Explanation: Follow 1 -> 3 -> 1 -> 1 -> 1 along the top row and right edge.
Example 2:
Input: grid = [[1,2,3],[4,5,6]]
Output: 12
Explanation: The cheapest route reads 1 -> 2 -> 3 -> 6.
Example 3:
Input: grid = [[0]]
Output: 0
Explanation: The start and end are the same cell, counted once.
Constraints
- 1 <= grid.length, grid[0].length <= 200
- 0 <= grid[row][col] <= 200
Accepted4/5|Acceptance Rate80.0%