Leetcode63

最新推荐文章于 2022-12-05 22:50:02 发布

ZyyIsPig

最新推荐文章于 2022-12-05 22:50:02 发布

阅读量79

点赞数

分类专栏： leetcode 文章标签： leetcode 算法数据结构动态规划

本文链接：https://blog.csdn.net/qq_41904699/article/details/109411341

版权

leetcode 专栏收录该内容

40 篇文章 0 订阅

订阅专栏

动态规划

- 不带障碍
- 带障碍

不带障碍

分情况讨论，第一行、第一列以及其他情况
其他情况中当前位置的值（即路径数）等于上方元素的值加左方元素的值

/**
 * @author ：hodor007
 * @date ：Created in 2020/10/31
 * @description ：
 * @version: 1.0
 */
public class Solution {
    public int uniquePaths(int m, int n) {
        int[][] matrix = new int[m][n];
        matrix[0][0] = 1;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if(i == 0){
                    //第一行
                    if(j != 0){
                        matrix[i][j] = matrix[i][j - 1];
                    }
                } else {
                    //第一列
                    if(j == 0){
                        matrix[i][j] = matrix[i - 1][j];
                    } else {
                        matrix[i][j] = matrix[i - 1][j] + matrix[i][j - 1];
                    }
                }
            }
        }
        return matrix[m - 1][n - 1];
    }

    public static void main(String[] args) {
        Solution solution = new Solution();
        int ans = solution.uniquePaths(7, 3);
        System.out.println(ans);
    }
}

带障碍

加入障碍，将1用-1替代，方便计算

/**
 * @author ：hodor007
 * @date ：Created in 2020/11/1
 * @description ：
 * @version: 1.0
 */
public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int rows = obstacleGrid.length;
        int columns = obstacleGrid[0].length;

        //特判
        //起始点（？？？）和终点（？？？）有障碍时没有路径[题出的真有毛病]
        if(obstacleGrid[rows - 1][columns - 1] == 1)
            return 0;

        if(obstacleGrid[0][0] == 1)
            return 0;

        //把1替换为-1
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < columns; j++) {
                if(obstacleGrid[i][j] == 1){
                    obstacleGrid[i][j] = -1;
                }
            }
        }
        obstacleGrid[0][0] = 1;

        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < columns; j++) {
                if(i == 0){
                    //第一行的情况
                    if(j != 0){
                        if(obstacleGrid[i][j] == -1){

                        } else if(obstacleGrid[i][j - 1] == -1){
                            obstacleGrid[i][j] = 0;
                        } else {
                            obstacleGrid[i][j] = obstacleGrid[i][j - 1];
                        }
                    }
                } else {
                    //第一列的情况
                    if(j == 0){
                        if(obstacleGrid[i][j] == -1){

                        } else if(obstacleGrid[i - 1][j] == -1){
                            obstacleGrid[i][j] = 0;
                        } else {
                            obstacleGrid[i][j] = obstacleGrid[i - 1][j];
                        }
                    } else {
                        if(obstacleGrid[i][j] == -1){

                        } else if(obstacleGrid[i - 1][j] == -1){
                            //一边被堵上
                            if(obstacleGrid[i][j - 1] == -1){
                                //两边被堵上
                                obstacleGrid[i][j] = 0;
                            } else {
                                obstacleGrid[i][j] = obstacleGrid[i][j - 1];
                            }
                        } else if(obstacleGrid[i][j - 1] == -1){
                            //一边被堵上
                            obstacleGrid[i][j] = obstacleGrid[i - 1][j];
                        } else {
                            obstacleGrid[i][j] = obstacleGrid[i - 1][j] + obstacleGrid[i][j - 1];
                        }
                    }
                }
            }
        }
        return obstacleGrid[rows - 1][columns - 1];
    }

    public static void main(String[] args) {
//        int[][] obstacleGrid = {
//                {0,0,0,0,0,0,0},
//                {0,0,-1,0,0,0,0,0},
//                {0,0,0,0,0,0,0}
//        };

//        int[][] obstacleGrid = {
//                {0,1},
//                {1,0}
//        };

//        int[][] obstacleGrid = {
//                {1}
//        };

//        int[][] obstacleGrid = {
//                {0}
//        };

        int[][] obstacleGrid = {
                {0,1}
        };
        Solution solution = new Solution();
        int ans = solution.uniquePathsWithObstacles(obstacleGrid);
        System.out.println(ans);
    }
}