LeetCode进阶之路(Unique Paths II)

本文介绍了一种求解在网格中存在障碍物时从起点到终点的不同路径数量的算法。该算法首先将障碍物标记为特殊值,然后通过动态规划的方法计算每个位置到达终点的路径数。最终返回右下角的值即为不同路径的数量。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Follow up for "Unique Paths":

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.

For example,

There is one obstacle in the middle of a 3x3 grid as illustrated below.

[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]

The total number of unique paths is 2.

题目:这道题是上一题的升级版,中间加了一个障碍,其实只要把障碍地方的解变为 0 就好。

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int row = obstacleGrid.length;
        if(row < 1 ) return 0;
        int col = obstacleGrid[0].length;
        if(col < 1) return 0;
        
        if(obstacleGrid[0][0] == 1|| obstacleGrid[row-1][col-1]==1) return 0;
        
        for(int i = 0;i < row;i++) {
            for(int j = 0;j < col;j++) {
                if(obstacleGrid[i][j] == 1){
                    obstacleGrid[i][j] = -1;
                }
            }
        }
        
        for(int i = 0;i < row;i++){
            if(obstacleGrid[i][0] == -1) {
                break;
            } else {
                obstacleGrid[i][0] = 1;
            }
        }
        
        for(int i = 0;i < col;i++){
            if(obstacleGrid[0][i] == -1) {
                break;
            } else {
                obstacleGrid[0][i] = 1;
            }
        }
        
        for(int i = 1;i < row;i++) {
            for(int j = 1;j < col;j++) {
                if(obstacleGrid[i][j] != -1) {
                    if(obstacleGrid[i-1][j] ==-1 && obstacleGrid[i][j-1] == -1) {
                        continue;
                    }else if(obstacleGrid[i-1][j] ==-1) {
                        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[row-1][col-1];
    }

种一棵树最好的时间是十年前,其次是现在!

一忙就忘了更新这事,看来得定个闹钟提醒自己了!

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值