[Leetcode]Unique Path II

原创 2015年11月21日 00:08:38

Unique Paths II My Submissions Question
Total Accepted: 51318 Total Submissions: 180828 Difficulty: Medium
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.

Subscribe to see which companies asked this question
一道没啥难度的题,把不可达的位置强制置为0即可,一次AC

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

P.S 空间复杂度或许可以利用滚动数组降低下?睡觉时候想一想,想出来了更新

版权声明:转载请注明出处

相关文章推荐

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

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

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...

LeetCode 1.Minimum Path Sum 2.Unique Paths I and II

大家好,我是刘天昊,快到端午节了,今天说两道动态规划的题目(话说动规真的挺难的) 当然这三题是一样的解体思路先看Unique Paths  A robot is located a...

LeetCode 62/63/120/64 Unique PathsI/II Triangle/Min sum Path/Rectangle Area--DP

一:unique Path 题目: A robot is located at the top-left corner of a m x n grid (marked 'Start' in the ...

leetcode解题之62&63. Unique Paths ||64. Minimum Path Sum java版(路径(最短)可达)

leetcode解题之62&63. Unique Paths || java版(路径可达) ,63. Unique Paths II ,62. Unique Paths 。64. Minimum Pa...

leetCode 95.Unique Binary Search Trees II (唯一二叉搜索树) 解题思路和方法

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For ...

LeetCode 95. Unique Paths II

class Solution { public: int uniquePathsWithObstacles(vector>& obstacleGrid) { int row = obstacle...

LeetCode 95, 96. Unique Binary Search Trees i. ii

1. 题目描述 95.Given n, generate all structurally unique BST’s (binary search trees) that store values...

Leetcode: Unique Binary Search Trees II

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For ...

[leetcode]95. Unique Binary Search Trees II

题目链接:95. Unique Binary Search Trees IIGiven an integer n, generate all structurally unique BST’s (bi...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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