63. Unique Paths II 到达终点的路径总数

最新推荐文章于 2024-04-01 00:43:20 发布

duanjinlong、

最新推荐文章于 2024-04-01 00:43:20 发布

阅读量160

点赞数

分类专栏： leetcode 代码

本文链接：https://blog.csdn.net/LLL_foever/article/details/103272883

版权

代码同时被 2 个专栏收录

36 篇文章 0 订阅

订阅专栏

leetcode

31 篇文章 0 订阅

订阅专栏

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

Note: m and n will be at most 100.

Example 1:

Input:
[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]
Output: 2
Explanation:
There is one obstacle in the middle of the 3x3 grid above.
There are two ways to reach the bottom-right corner:
1. Right -> Right -> Down -> Down
2. Down -> Down -> Right -> Right

题意：和题Unique Paths的区别在于：题目给了一个二维数组，如果数组中的值为0，则可以通过，如果值为1，则代表路径中有障碍物不能通过，求有多少条路径可以到达终点。

思路：将有障碍的点的可通过路径总数设为0，然后用Unique Paths的思路求出每个点的可通过路径总数即可。

代码：

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m= obstacleGrid.length;
        int n = obstacleGrid[0].length;
        if(obstacleGrid[0][0] == 1)  //存在最初点为1的测试用例
            return 0;
        for(int i=0;i<m;i++) {       //初始化第一列
            if(obstacleGrid[i][0]==0){
                obstacleGrid[i][0] = 1;
            }
            else {                  //如果途中存在障碍，则后面的路径都不能通过
                for(;i<m;i++)
                {
                    obstacleGrid[i][0]=0;
                }
                break;
            }
        }

        for (int j = 1; j < n; j++) {  //初始化第一排，j从1开始，
            if(obstacleGrid[0][j]==0){
                obstacleGrid[0][j] = 1;
            }
            else {
                for(;j<n;j++)
                {
                    obstacleGrid[0][j]=0;
                }
                break;
            }
        }
        for(int i=1;i<m;i++){
            for(int j=1;j<n;j++){
                if(obstacleGrid[i][j]==1)                    
                    obstacleGrid[i][j] = 0;
                else
                    obstacleGrid[i][j]=obstacleGrid[i-1][j] + obstacleGrid[i][j-1];
            }
        }
        return obstacleGrid[m-1][n-1];
    }
}