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.
Example:
Input: [ [1,3,1], [1,5,1], [4,2,1] ] Output: 7 Explanation: Because the path 1→3→1→1→1 minimizes the sum.
Note:
Convert the previous solution to an iterative one. Your algorithm should run in O(n * m) time and use O(n * m) extra space.
Walkthroughs of the solution. Try the steps first, then watch to compare approaches.
Solution #2 · O(n^2) Memoization / Caching
Free plan: 30 tutor messages. Premium is unlimited.
Saved
Ctrl + Enter to check