Categorygithub.com/SmartsYoung/LeetCode-in-GoAlgorithms0064.minimum-path-sum
package
0.0.0-20210525112244-a601ee6fe7cf
Repository: https://github.com/smartsyoung/leetcode-in-go.git
Documentation: pkg.go.dev
Overview
Versions
1
Dependencies
0
Dependents
0
Files
34 SLOC

# README

64. Minimum Path Sum

题目

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.

解题思路

和62. Unique Paths的解题思路一样。

见程序注释