CODE 70: Unique Paths II

原创 2013年10月07日 23:22:17

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.

	public int uniquePathsWithObstacles(int[][] obstacleGrid) {
		// Note: The Solution object is instantiated only once and is reused by
		// each test case.
		int m = obstacleGrid.length;
		int n = obstacleGrid[0].length;
		int[][] sum = new int[m][n];
		sum[0][0] = obstacleGrid[0][0] == 1 ? 0 : 1;
		for (int i = 1; i < m; i++) {
			if (obstacleGrid[i][0] == 1) {
				sum[i][0] = 0;
			} else {
				sum[i][0] = sum[i - 1][0];
			}
		}
		for (int i = 1; i < n; i++) {
			if (obstacleGrid[0][i] == 1) {
				sum[0][i] = 0;
			} else {
				sum[0][i] = sum[0][i - 1];
			}
		}
		for (int i = 1; i < m; i++) {
			for (int j = 1; j < n; j++) {
				if (obstacleGrid[i][j] != 1) {
					sum[i][j] = sum[i - 1][j] + sum[i][j - 1];
				} else {
					sum[i][j] = 0;
				}

			}
		}
		return sum[m - 1][n - 1];
	}


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

Unique Paths II -- LeetCode

原题链接: http://oj.leetcode.com/problems/unique-paths-ii/  这道题跟Unique Paths非常类似,只是这道题给机器人加了障碍,不是每次都有两个...
  • linhuanmars
  • linhuanmars
  • 2014年03月26日 04:15
  • 10723

[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
  • 757

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

[C++]LeetCode: 78 Unique Paths II

题目: Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many ...
  • cinderella_niu
  • cinderella_niu
  • 2015年01月08日 13:08
  • 656

【LeetCode】Unique Paths 解题报告

【题目】 A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram belo...
  • ljiabin
  • ljiabin
  • 2014年12月08日 17:19
  • 4067

LeetCode -- Unique Paths II

LeetCode -- Unique Paths II
  • csharp25
  • csharp25
  • 2015年12月01日 09:45
  • 503

LeetCode 62 — Unique Paths(C++ Java Python)

题目:http://oj.leetcode.com/problems/unique-paths/ A robot is located at the top-left corner of a m ...
  • dragon_dream
  • dragon_dream
  • 2014年02月23日 22:00
  • 2461

Unique path ii

Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many uni...
  • sinat_24520925
  • sinat_24520925
  • 2015年07月26日 23:05
  • 499

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
  • 878
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:CODE 70: Unique Paths II
举报原因:
原因补充:

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