【力扣64-最小路径和】dp(golang)

题目描述

https://leetcode-cn.com/problems/minimum-path-sum/

思路题解

和62-不同路径差不多，是62的进阶版

go代码

func minPathSum(grid [][]int) int {
	m:=len(grid)
	n:=len(grid[0])
	p:=make([][]int,m)
	//初始化dp数组p
	for i:=0;i<m;i++{
		p[i]=make([]int,n)
		if i==0{
			p[0][0]=grid[0][0]
			for j:=1;j<n;j++{
				p[i][j]=p[i][j-1]+grid[i][j]
			}
		}
		if i>0{
			p[i][0]=p[i-1][0]+grid[i][0]
		}
	}
	//求p
	for i:=1;i<m;i++{
		for j:=1;j<n;j++{
			p[i][j]=min(p[i-1][j],p[i][j-1])+grid[i][j]
		}
	}
	return p[m-1][n-1]
}
func min(i,j int)int{
	if i>j{return j}else {return i}
}