leetcode 63:Unique Paths II

原创 2015年11月19日 20:56:09

题目:

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很像,只不过加了一个路障,我们可以把路障地方的DP设置为0.则可以将Unique Paths的动态规划方法用过来。

时间复杂度:O(m*n)

实现如下:

class Solution {
public:
	int uniquePathsWithObstacles(vector<vector<int>>& nums) {
		int size1 = nums.size();
		if (size1 < 1) return 0;
		int size2 = nums[0].size();
		vector<vector<int>> DP(size1, vector<int>(size2, 1));
		for (int i = 0; i < size1; i++)
			for (int j = 0; j < size2; j++)
			{
				if (nums[i][j] == 1) DP[i][j] = 0;  //注意这一步处理
				else if (i > 0 && j > 0)	DP[i][j] = DP[i][j - 1] + DP[i - 1][j];
				else if (i > 0) DP[i][j] = DP[i-1][j];
				else if(j>0) DP[i][j] = DP[i][j - 1];
			}
		return DP[size1 - 1][size2 - 1];
	}
};


版权声明:本文为博主原创文章,未经博主允许不得转载。

LeetCode - 63. Unique Paths II

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

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

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

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

Leetcode 63. Unique Paths II

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

[Leetcode刷题总结系列][Dynamic Programming]63. Unique Paths II

Unique Paths II Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. ...

Leetcode NO.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. ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode 63:Unique Paths II
举报原因:
原因补充:

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