LeetCode 62 Unique Paths & 63 Unique Paths II

题目 (leetcode62)

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

How many possible unique paths are there?

Note:
m and n will be at most 100.

解法

使用动态规划解决，用matrix存储到达点(i,j)的路径个数。起点matrix[0][0]为1，对于其他点(i,j)只能从上边(i-1,j)或左边(i,j-1)到达，matrix[i][j] = matrix[i-1][j] + matrix[i][j-1]

class Solution {
public:
    int uniquePaths(int m, int n) {
        int matrix[m][n];        
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(i == 0 && j == 0) {
                    matrix[i][j] = 1;
                    continue;
                }                
                int top = i-1>=0 ? matrix[i-1][j] : 0;
                int left = j-1>=0 ? matrix[i][j-1] : 0;
                matrix[i][j] = top + left;
            }
        }
        return matrix[m-1][n-1];
    }
};

题目 (leetcode63)

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.

解法

跟上一题一样的解题思路，不过加了一步判断，如果obstacleGrid[i][j]=1则代表此处无法通行，该位置对应的matrix[i][j]=0

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid.size();
        if (m == 0) return 0;
        int n = obstacleGrid[0].size();
        if (n == 0) return 0;
        int matrix[m][n];
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if (obstacleGrid[i][j] == 1)
                    matrix[i][j] = 0;
                else {
                    if(i == 0 && j == 0) {
                        matrix[i][j] = 1;
                        continue;
                    }
                    int top = i-1 >= 0 ? matrix[i-1][j] : 0;
                    int left = j-1 >= 0 ? matrix[i][j-1] : 0;
                    matrix[i][j] = top + left;
                }
            }
        }
        return matrix[m-1][n-1];
    }
};