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.

分析

类似《剑指Offer》中的礼物的最大价值，利用DP算法求解，同样可以将二维DP简化成长度为n的DP向量求解。

二维DP：

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

一维DP：

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