关闭

LeetCode Unique Paths II

标签: leetcode
173人阅读 评论(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的一个变种,就是在二维数组中增加一些特殊的障碍,但是其实归根到底都是DP(动态规划)的类型。考虑几种特殊情况就行了,首先这里增加了一个obstacleGrid数组,这个数组中存储有每个位置上的值,1代表有障碍,0代表没有障碍;那么我另外又开了一个二维数组用来保存走到每一个位置的种树。但是这里要考虑的是,在第一行和第一列中,如果一旦一个位置出现了1,那么后面的所有格子都将是0,这里要特别注意。另外格子和之前考虑的一样,都是左边和上边的那两个格子的值相加。

public static int uniquePathsWithObstacles(int[][] obstacleGrid)
	{
		int m = obstacleGrid.length;
		int n = obstacleGrid[0].length;
		int[][] nums = new int[m][n];
		if(obstacleGrid[0][0] == 1)
			return 0;
		nums[0][0] = 1;
		for(int i = 0; i < m; i++)
		{
			for(int j = 0; j < n; j++)
			{
				if(i == 0 && j > 0)
				{
					if(obstacleGrid[i][j] == 0 && obstacleGrid[i][j - 1] != 1 && nums[i][j-1] != 0)
						nums[i][j] = 1;
					else if(obstacleGrid[i][j] == 0 && obstacleGrid[i][j - 1] == 1)
						nums[i][j] = 0;
					else if(obstacleGrid[i][j] == 1)
						nums[i][j] = 0;
				}
				if(i > 0 && j == 0)
				{
					if(obstacleGrid[i][j] == 0 && obstacleGrid[i-1][j] != 1 && nums[i-1][j] != 0)
						nums[i][j] = 1;
					else if(obstacleGrid[i][j] == 0 && obstacleGrid[i-1][j] == 1)
						nums[i][j] = 0;
					else if(obstacleGrid[i][j] == 1)
						nums[i][j] = 0;
				}
				if(i > 0 && j > 0)
				{
					if(obstacleGrid[i][j] == 1)
						nums[i][j] = 0;
					else if(obstacleGrid[i][j] != 1)
						nums[i][j] = nums[i-1][j] + nums[i][j-1];
				}
			}
		}
		return nums[m-1][n-1];
	}


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
  • 2494

【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 95. Unique Paths II

class Solution { public: int uniquePathsWithObstacles(vector>& obstacleGrid) { int row = obstacle...
  • vvickey11
  • vvickey11
  • 2017-05-05 11:12
  • 94

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

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

【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
  • 148

leetcode_Unique Paths II

描述: Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How...
  • dfb198998
  • dfb198998
  • 2015-05-16 08:51
  • 343

LeetCode:Unique Paths II

Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many uni...
  • fytain
  • fytain
  • 2013-08-31 16:53
  • 732

《leetCode》:Unique Paths II

题目描述Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many uni...
  • u010412719
  • u010412719
  • 2015-11-22 20:51
  • 341
    个人资料
    • 访问:175155次
    • 积分:4214
    • 等级:
    • 排名:第8400名
    • 原创:243篇
    • 转载:108篇
    • 译文:0篇
    • 评论:28条
    最新评论