LeetCode 63.Unique Paths II

LeetCode 63.Unique Paths II

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.

Note: m and n will be at most 100.

动态规划题,在上一题的基础上增加了一些条件,在grid[i][j]位置,若为1,则到该点的路径为0,若为0,则路径数目为count[i-1][j]+count[i][j-1]

public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m=obstacleGrid.length;
        int n=obstacleGrid[0].length;
        int count[][]=new int[m][n];
        int i,j;
        if(obstacleGrid[0][0]==1)
            return 0;
        else
            count[0][0]=1;
        for(i=1;i<m;i++)
            count[i][0]=(obstacleGrid[i][0]==1?0:count[i-1][0]);
        for(j=1;j<n;j++)
            count[0][j]=(obstacleGrid[0][j]==1?0:count[0][j-1]);
        for(i=1;i<m;i++){
            for(j=1;j<n;j++){
                count[i][j]=(obstacleGrid[i][j]==1?0:count[i][j-1]+count[i-1][j]); 
            }
        }
        return count[m-1][n-1];
    }
    当然,若希望空间复杂度为O(1),可以不另开辟空间,直接将各个位置路径数目存储在obstacleGrid中。
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值