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 7 x 3 grid. How many possible unique paths are there?

Note: m and n will be at most 100.

Example 1:

Input: m = 3, n = 2
Output: 3
Explanation:
From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:
1. Right -> Right -> Down
2. Right -> Down -> Right
3. Down -> Right -> Right

Example 2:

Input: m = 7, n = 3

Output: 28

方法一：动态规划

class Solution {
public:
    int uniquePaths(int m, int n)     
    {        
        //动态规划方程，dp[m-1][n-1]表示从top-left(0,0)到m-1,n-1(即bottom-right)的所有unique path          
        //dp[i][j] = dp[i-1][j] + dp[i][j-1] 如果存在上一列和上一行         
        //可以化简为dp[j] = dp[j-1] + dp[j]          
        if(m == 0 || n == 0) 
            return 0;             
        //第一行应该初始化为1  m=1或n=1，dp为1          
        vector<vector<int>> dp(m,vector<int>(n,1));          
        //除去第一行，还有m-1行需要计算          
        for(int ri = 1; ri < m; ri++)          
        {              
            //若n=1, dp[0]为1，则不需要计算，只需要计算其余n-1列。              
            for(int ci = 1; ci < n; ci++)              
            {                  
                //dp[ci] = dp[ci-1] + dp[ci];                  
                dp[ri][ci] = dp[ri][ci-1]+dp[ri-1][ci];              
            }          
        }           
        return dp[m-1][n-1];      
    }
};

方法二：排列组合

class Solution {
public:    
        int uniquePaths(int m, int n)     
        {        
            return Cmn(m+n-2,m-1);    
        }    
        int Cmn(int m,int n)    
        {        
            if(m==n||n==0)            
                return 1;        
            else            
                return Cmn(m-1,n)+Cmn(m-1,n-1);    
        }
};