关闭

【leetcode】63. Unique Paths II

标签: leetcode
147人阅读 评论(0) 收藏 举报
分类:

一、题目描述

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.


思路:动态规划,还是用的“Unique Paths” 这道题的思想,不过设置了障碍之后,对于第一行和第一列要单独拿出来处理。用path[i][j] 表示到[i][j]位置的路径的条数,先判断[i][j]位置是否是障碍,即值是否是1,如果是障碍,那么path[i][j]=0,否则用状态转换方程path[i][j] = path[i-1][j] + path[i][j-1]


c++代码(3ms,26.70%)

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m,n; 
        m = obstacleGrid.size();
        n = obstacleGrid[0].size();
        int i,j;
        int path[m][n];
        path[0][0] = obstacleGrid[0][0]==0?1:0;
        for(i=1; i<n;i++){  //先处理第一行
            if(obstacleGrid[0][i] == 1){
                path[0][i]=0;
            }else{
                path[0][i] = path[0][i-1];
            }
        }
        for(i=1;i<m;i++){  //处理第一列
            if(obstacleGrid[i][0] == 1){
                path[i][0] = 0;
            }else{
                path[i][0] = path[i-1][0];
            }
            
        }
        
        for(i=1;i<m;i++){
            for(j=1;j<n;j++){
                if(obstacleGrid[i][j] == 1){
                    path[i][j]=0;
                }else{
                    path[i][j] = path[i-1][j] + path[i][j-1];
                }
            }
        }
        
        return path[m-1][n-1];
    }
};


c++代码2(3ms)

往外扩展一行一列,左上角位置从1,1开始。这样对于第一行第一列就不需要单独拿出来讨论了。

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




0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

【LeetCode-面试算法经典-Java实现】【062-Unique Paths(唯一路径)】

【062-Unique Paths(唯一路径)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  A robot is located at the top-left cor...
  • DERRANTCM
  • DERRANTCM
  • 2015-08-01 07:16
  • 1680

【LeetCode-面试算法经典-Java实现】【113-Path Sum II(路径和)】

【113-Path Sum II(路径和II)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a binary tree and a sum, find al...
  • DERRANTCM
  • DERRANTCM
  • 2015-08-12 06:23
  • 2496

【LeetCode-面试算法经典-Java实现】【063-Unique Paths II(唯一路径问题II)】

【063-Unique Paths II(唯一路径问题II)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Follow up for “Unique Paths”: ...
  • DERRANTCM
  • DERRANTCM
  • 2015-08-01 07:19
  • 1786

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...
  • dragon_dream
  • dragon_dream
  • 2014-02-25 22:19
  • 2034

【leetcode】【63】Unique Paths II

一、问题描述 Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. ...
  • xiaoliucool1314
  • xiaoliucool1314
  • 2016-03-02 09:46
  • 149

LeetCode-63. Unique Paths II

Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many uni...
  • u012848330
  • u012848330
  • 2016-10-07 15:30
  • 139

[LeetCode]--63. Unique Paths II

Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique ...
  • bug_moving
  • bug_moving
  • 2016-12-03 17:06
  • 269

<LeetCode OJ> 62. / 63. Unique Paths(I / II)

63. Unique Paths II My Submissions Question Total Accepted: 55136 Total Submissions: 191949 Diff...
  • EbowTang
  • EbowTang
  • 2016-01-08 22:05
  • 1955

Unique Paths II - LeetCode 63

题目描述: Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How ma...
  • bu_min
  • bu_min
  • 2015-05-07 21:04
  • 193

Leetcode NO.63 Unique Paths II

题目要求如下: Follow up for "Unique Paths": Now consider if some obstacles are added to the grids....
  • u012290414
  • u012290414
  • 2015-02-07 08:07
  • 336
    个人资料
    • 访问:200094次
    • 积分:4066
    • 等级:
    • 排名:第8844名
    • 原创:229篇
    • 转载:0篇
    • 译文:0篇
    • 评论:74条
    最新评论