P0ny的博客

class Solution(object): def allPathsSourceTarget(self, graph): """ :type graph: List[List[int]] :rtype: List[List[int]] """ res = []

分析：到达（m,n）有两种方式1.从（m-1,n）2.从（m,n-1） f(m,n)为从（0,0）到(m,n)所需的最小路径和。 则f(m,n)=min(f(m-1,n), f(m,n-1))+grid(m,n)class Solution(object): def minPathSum(self, grid): """ :type grid: ...