Leetcode 64. Minimum Path Sum
Leetcode 64. Minimum Path Sum
We use an extra matrix dp of the same size as the original matrix. In this matrix, dp(i, j) represents the minimum sum of the path from the index (i, j) to the bottom rightmost element. We start by initializing the bottom righ
原创
2020-06-04 08:15:30 ·
73 阅读 ·
0 评论