[Leetcode] 62. Unique Paths 解题报告

题目：

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?

Above is a 3 x 7 grid. How many possible unique paths are there?

Note: m and n will be at most 100.

思路：

这道题目应该是最简单的二维动态规划了。定义dp[i][j]表示到达第j行，第i列的总个数，则递推方程为：dp[i][j] = dp[i - 1][j] + dp[i][j - 1]。这里我主要说一下关于空间复杂度的优化：注意到递推方程中当前值仅仅和它的右边值和上边值有关（即只和与它最靠近的常数个变量有关），这种情况可以采用滚动数组来实现，从而将空间复杂度从O(m*n)降低到O(n)，见代码片段2。其中关键语句dp[col] = dp[col - 1] + dp[col]中，第一个dp[col]表示更新后的dp[col]的值，而第二个dp[col]表示更新前的dp[col]的值。

代码：

1、动态规划之二维数组：

class Solution {
public:
    int uniquePaths(int m, int n) {
        if (m <= 0 || n <= 0) {
            return 0;
        }
        vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
        dp[0][1] = 1; 
        for (int row = 1; row <= m; ++row) {
            for (int col = 1; col <= n; ++col) {
                dp[row][col] = dp[row - 1][col] + dp[row][col - 1];
            }
        }
        return dp[m][n];
    }
};

2、动态规划之一维数组：

class Solution {
public:
    int uniquePaths(int m, int n) {
        if (m <= 0 || n <= 0) {
            return 0;
        }
        vector<int> dp(n + 1, 0);
        dp[1] = 1;
        for (int row = 1; row <= m; ++row) {
            for (int col = 1; col <= n; ++col) {
                dp[col] = dp[col - 1] + dp[col];
            }
        }
        return dp[n];
    }
};