Unique Paths

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

 

思路：f(i,j)=f(i-1,j)+f(i,j)。因此只需要第一行和第一列即可求出来最后一个。C++中的二维数组可以用vector初始化。

为了方便可以全部初始化为1。

class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<vector<int>>dp(m,vector<int>(n,1));//由于要需要知道第一行第一列，可单独分开初始化。然而全部初始化为1也可以。
        for(int i=1;i<m;i++)
        {
            for(int j=1;j<n;j++)
            {
                
                dp[i][j]=dp[i-1][j]+dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
        
    }
};