算法-独一道路问题

独一道路问题

public int uniquePaths(int m, int n) {
         if(m == 0 || n == 0) {
             return 1;
         }
        int[][] path = new int[m][n];
        //初始化x=1
        for (int i  = 0; i < m; i++) {
            path[i][0] = 1;
        }    
        //初始化y=1
        for (int i = 0; i < n; i++) {
            path[0][i] = 1;
        }
        
        //当前节点=上面一个节点+前面一个节点
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                path[i][j] = path[i - 1][j] + path[i][j - 1];
            }
        }
        //唯一道路
        return path[m - 1][n - 1];
    }


    

独一道路有障碍节点的的道路

    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if (obstacleGrid == null || obstacleGrid.length == 0) {
            return 1;
        }
        if (obstacleGrid[0] == null || obstacleGrid[0].length == 0) {
            return 1;
        }
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] result = new int[m][n];
        for (int i = 0; i < m; i++) {
            if (obstacleGrid[i][0] != 1) {
                result[i][0] = 1;
            } else {
                break;
            }
        }
        for (int j = 0; j < n; j++) {
            if (obstacleGrid[0][j] != 1) {
                result[0][j] = 1;
            } else {
                break;
            }
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                //障碍节点 赋值0
                if (obstacleGrid[i][j] == 1) {
                    result[i][j] = 0;
                } else {
                    result[i][j] = result[i - 1][j] + result[i][j - 1];
                }
            }
        }
        return result[m - 1][n - 1];
    }