提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

---

前言

`

---

一、力扣62. 不同路径

java">class Solution {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        for(int i = 0; i < n; i ++){
            dp[0][i] = 1;
        }
        for(int i = 0; i < m; i ++){
            dp[i][0] = 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) {
        int row = obstacleGrid.length, col = obstacleGrid[0].length;
        int[][] dp = new int[row][col];
        for(int i = 0; i < col && obstacleGrid[0][i] != 1; i ++){
            dp[0][i] = 1;
        }
        for(int i = 0; i < row && obstacleGrid[i][0] != 1; i ++){
            dp[i][0] = 1;
        }
        for(int i = 1; i < row; i ++){
            for(int j = 1; j < col; j ++){
                if(obstacleGrid[i][j] == 1){
                    dp[i][j] = 0;
                }else{
                    dp[i][j] = dp[i-1][j] + dp[i][j-1];
                }
            }
        }
        return dp[row-1][col-1];
    }
}