day39｜● 62.不同路径 ● 63. 不同路径 II

62.不同路径

1. 确定dp数组（dp table）以及下标的含义
   dp[i][j] ：表示从（0 ，0）出发，到(i, j) 有dp[i][j]条不同的路径。
2. 确定递推公式
   路径从两个方向来，相加，注意不是步数不用+1
3. dp数组的初始化
   上边和左侧边为1，因为只可以向右向下，只有一条路径
4. 确定遍历顺序
   从左上方0开始
5. 举例推导dp数组

class Solution {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int j = 0; j < n; j++) {
            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

不同在于有障碍，所以一旦障碍就dp为0了，也要注意初始化，一旦有障碍，这一排或列剩下的都0， 即不能到达。

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] dp = new int[m][n];
        for (int i = 0; i < m; i++){
            if (obstacleGrid[i][0] == 1) {
                dp[i][0] = 0;
                while (i != m-1) {
                   dp[i][0] = 0;
                   i++; 
                }
            } else {
                dp[i][0] = 1;
            }
        }
        for (int j = 0; j < n; j++){
            if (obstacleGrid[0][j] == 1) {
                dp[0][j] = 0;
                while (j != n-1) {
                    dp[0][j] = 0;
                    j++;
                }

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

注意这里简化版的初始化，特别是for循环的简化，加了and一旦不符合就会立刻break跳出

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] dp = new int[m][n];

        //如果在起点或终点出现了障碍，直接返回0
        if (obstacleGrid[m - 1][n - 1] == 1 || obstacleGrid[0][0] == 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];
    }
}