Middle-题目61:63. Unique Paths II

原创 2016年05月31日 16:31:54

题目原文:
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.
题目大意:
Middle-题目21中,再增加一个障碍矩阵,有障碍的点是不能走的,仍然求不同的路径个数。
题目分析:
改动不大,有路障的点路径个数置0即可。需要注意一些特殊情况:如果起点有路障,则整个矩阵都是0;如果第一行(列)有路障,则路障点的右边(下边)都是0.。
源码:(language:java)

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] dp = new int[m][n];
        dp[0][0] = obstacleGrid[0][0]==0?1:0;
        for(int i=1;i<m;i++)
            if(obstacleGrid[i][0] == 0)
                dp[i][0]=dp[i-1][0];
        for(int i=1;i<n;i++)
            if(obstacleGrid[0][i] == 0)
                dp[0][i]=dp[0][i-1];
        for(int i=1;i<m;i++)
            for(int j=1;j<n;j++)
                if(obstacleGrid[i][j] == 0)
                    dp[i][j] = dp[i-1][j] + dp[i][j-1];
        return dp[m-1][n-1];
    }
}

成绩:
1ms,beats 17.74%,众数1ms,82.26%

版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs

相关文章推荐

【leetcode】【63】Unique Paths II

一、问题描述 Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. ...

LeetCode 63 — Unique Paths II(C++ Java Python)

题目:http://oj.leetcode.com/problems/unique-paths-ii/ Follow up for "Unique Paths": Now consider if so...

【leetcode】63. Unique Paths II

一、题目描述 Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How m...

LeetCode-63. Unique Paths II

Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many uni...

LeetCode - 63. Unique Paths II

这道题目与上一个题目是一样的,只是在matrix中有些小格子里有障碍,无法通行。基本的思路与上道题目是一样的,只是在初始化和进行DP的时候都要先进行一下检查,检查当前的访问到的[i][j] == 1,...

63. Unique Paths II 等题

62. Unique Paths原题: A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in th...

leetcode - 62,63. Unique Paths(II) & 64.Minimum Path Sum

算法系列博客之Dynamic Programming 本篇博客将运用动态规划的思想来解决leetcode上264号问题这三个题目的共同之处在于均是二维矩阵上的规划问题问题描述:62 Unique Pa...

LeetCode63——Unique Paths II

LeetCode63——Unique Paths II 跟LeetCode62——Unique Paths不同的是,这里是要在路径上设置障碍的。 因此不能用组合的方法去做了(也许可以,但我实在想不到)...

LeetCode_63---Unique Paths II

Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique...

LeetCode 64/62/63. Minimum Path Sum/ Unique Paths i, ii

1. 题目描述1.1 62 A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the dia...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)