【leetcode】63. Unique Paths II

标签: leetcode
234人阅读 评论(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];
    }
};




查看评论

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:29
  • 2138

LeetCode63:Unique Paths II

Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many uniqu...
  • u012501459
  • u012501459
  • 2015-06-12 16:05:00
  • 908

[LeetCode][Java] Unique Paths II

题目: Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How...
  • Evan123mg
  • Evan123mg
  • 2015-07-17 09:59:08
  • 799

63 Unique Paths II

题目链接:https://leetcode.com/problems/unique-paths-ii/题目:Follow up for "Unique Paths":Now consider if s...
  • ChilseaSai
  • ChilseaSai
  • 2015-10-17 15:31:45
  • 755

Leetcode 63:Unique Paths II

Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many uniqu...
  • geekmanong
  • geekmanong
  • 2016-02-24 00:15:36
  • 920

leetcode 63. Unique Paths II DP动态规划

Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique ...
  • JackZhang_123
  • JackZhang_123
  • 2017-09-05 10:32:21
  • 106

leetcode 62. Unique Paths-唯一路径|动态规划

Total Accepted: 80566 Total Submissions: 225855 Difficulty: Medium A robot is located at the top-...
  • happyaaaaaaaaaaa
  • happyaaaaaaaaaaa
  • 2016-03-11 15:16:22
  • 1913

leetCode 62.Unique Paths (唯一路径) 解题思路和方法

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). ...
  • xygy8860
  • xygy8860
  • 2015-07-15 14:23:47
  • 883

leetcode 63. Unique Paths II-唯一路径|动态规划

原文链接:Unique Paths II 【抛砖】 与Unique Paths不同的是,这里给机器人增加了障碍物,需要在递推式res[i][j]=res[i-1][j]+res[i][j-1]之前增加...
  • happyaaaaaaaaaaa
  • happyaaaaaaaaaaa
  • 2016-03-11 20:53:57
  • 1116

【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:35
  • 1942
    个人资料
    持之以恒
    等级:
    访问量: 27万+
    积分: 4677
    排名: 7786
    最新评论