代码随想录训练营 dp02

62. 不同路径

code

func uniquePaths(m, n int) int {
    dp := make([][]int, m)
    for i := range dp {
        dp[i] = make([]int, n)
        dp[i][0] = 1
    }
    for j := 0; j < n; j++ {
        dp[0][j] = 1
    }
    for i := 1; i < m; i++ {
        for j := 1; j < n; j++ {
            dp[i][j] = dp[i-1][j] + dp[i][j-1]
        }
    }
    return dp[m-1][n-1]
}

63. 不同路径 II

code

func uniquePathsWithObstacles(obstacleGrid [][]int) int {
        m,n:= len(obstacleGrid),len(obstacleGrid[0])
	    if (obstacleGrid[m - 1][n - 1] == 1 || obstacleGrid[0][0] == 1){return 0;}
        dp:= make([][]int,m)
        for i:=range dp{
            dp[i]= make([]int, n)
        }

        for i:=0;i<m && obstacleGrid[i][0] == 0 ;i++{dp[i][0] =1}
        for j:=0;j<n && obstacleGrid[0][j] == 0 ;j++{dp[0][j]=1}

        for i:=1;i<m;i++{
            for j:=1;j<n;j++{
                if obstacleGrid[i][j] ==1 { continue}
                dp[i][j] = dp[i-1][j] +dp[i][j-1] 
            }
        }
        return dp[m-1][n-1]

}