leetcode刷题｜动态规划 不同路径

不同路径

力扣链接

题解

Java代码

class Solution {
    public int uniquePaths(int m, int n) {
        //确定dp数组和i/j下标的含义：dp[i][j]从(0,0)出发到(i,j)有多少不同的路径
        //确定递推公式：dp[i][j] = dp[i-1][j] + dp[i][j-1]
        //dp数组的初始化: dp[i][0] = 1 dp[0][j] =1 初始化横竖
        //确定遍历顺序：一行一行遍历
        //举例推导
        int[][] dp = new int[m][n];

        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int j =0; i< n; i++) {
            dp[0][j] = 1;
        }

        for (int i =1; i < m; i++) {
            for (int j = 1; j< n; j++) {
                dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
    }
}

63.不同路径II

力扣链接

题解

Java代码

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        //确定dp数组和i j下标的含义：dp[i][j]从(0,0)到(i,j)有多少条不同的路径
        //推导递推公式：只有没有障碍物的时候 dp[i][j] = dp[i-1][j] + dp[i][j-1]
        //dp数组初始化
        //遍历顺序
        //举例推导
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;

        int[][] dp = new int[m][n];
        //如果数组的起点或者终点有障碍物，则直接返回
        if (obstacleGrid[0][0] == 1 || obstacleGrid[m-1][n-1] == 1) {
            return 0;
        }
        //数组初始化
        for (int i =0; i <m && obstacleGrid[i][0] == 0; i++) {
            dp[i][0] = 1;
        }
        for (int j=0; j<n && obstacleGrid[0][j] == 0; j++) {
            dp[0][j] = 1;
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j< n; j++) {
                dp[i][j] = obstacleGrid[i][j] == 0 ? dp[i-1][j] + dp[i][j-1] : 0;
            }
        }
        return dp[m-1][n-1];
    }
}