LeetCode 63. Unique Paths II（动态规划）

题目来源：https://leetcode.com/problems/unique-paths-ii/

问题描述

63. Unique Paths II

Medium

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

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.

Note: m and n will be at most 100.

Example 1:

Input:

[

  [0,0,0],

  [0,1,0],

  [0,0,0]

]

Output: 2

Explanation:

There is one obstacle in the middle of the 3x3 grid above.

There are two ways to reach the bottom-right corner:

1. Right -> Right -> Down -> Down

2. Down -> Down -> Right -> Right

------------------------------------------------------------

题意

给定一个m×n的棋盘矩阵obstacleGrid，矩阵中为1的元素表示障碍不能通行。同LeetCode 62. Unique Paths（动态规划）题，机器人一开始在棋盘左上角，且只能向下或向右移动。问机器人移动到右下角有几种不同的路线。

------------------------------------------------------------

思路

同LeetCode 62. Unique Paths（动态规划）题，用时间复杂度为O(mn)、空间复杂度O(n)的动态规划求解，只是要注意碰到障碍则置0. 标答的空间复杂度仅为O(1)，原因是标答直接使用了形参obstacleGrid作为dp数组。

------------------------------------------------------------

代码

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        if (m == 0)
        {
            return 0;
        }
        int n = obstacleGrid[0].length;
        if (n == 0)
        {
            return 0;
        }
        int[] dp = new int[n];
        if (obstacleGrid[0][0] == 1)
        {
            return 0;
        }
        else
        {
            dp[0] = 1;
        }
        int i = 0, j = 0;
        for (j=1; j<n; j++)
        {
            if (obstacleGrid[0][j] == 1)
            {
                break;
            }
            else
            {
                dp[j] = 1;
            }
        }
        for (i=1; i<m; i++)
        {
            if (obstacleGrid[i][0] == 1)
            {
                dp[0] = 0;
            }
            for (j=1; j<n; j++)
            {
                if (obstacleGrid[i][j] == 1)
                {
                    dp[j] = 0;
                }
                else
                {
                    dp[j] += dp[j-1];
                }
            }
        }
        return dp[n-1];
    }
}