LeetCode63. Unique Paths II（C++）

最新推荐文章于 2022-12-17 10:35:17 发布

原创最新推荐文章于 2022-12-17 10:35:17 发布 · 473 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

110 篇文章

订阅专栏

本文探讨了在一个m x n网格中，机器人如何避开障碍物，从起点到达终点的问题。通过动态规划的方法，使用一个二维数组记录从起点到各点的路径数，实现了计算从起点到终点的路径总数。

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

解题思路：用一个cnt数组记录从出发点到该点的路径数，如果该点有障碍，则该点的cnt为0，若该点无障碍，则该点的cnt为该点上面一点的cnt与左边一点的cnt的和，同时要考虑行列号为0的情况。

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m=obstacleGrid.size(),n=obstacleGrid[0].size();
        if(m == 0||n == 0)
            return 0;
        int cnt[m][n]={0};
        for(int i = 0; i < m; ++i){
            for(int j = 0; j < n; ++j){
                if(obstacleGrid[i][j] == 1)
                    cnt[i][j] = 0;
                else if (i == 0&&j == 0)
                    cnt[i][j] = 1;
                else if(i == 0)
                    cnt[i][j] = cnt[i][j-1];
                else if(j == 0)
                    cnt[i][j] = cnt[i-1][j];
                else
                    cnt[i][j] = cnt[i][j-1] + cnt[i-1][j];
            }
                
        }
        return cnt[m-1][n-1];
    }
    
};