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

Note: m and n will be at most 100.

题目链接：https://leetcode.com/problems/unique-paths/description/

题目大意：n * m的格子，规定只能向右或向前走，求从最左上的格子走到最右下的格子有多少条不同路径。

解题思路：到达目标格子的上一步只有两种情况：上边的格子或者左边的格子。即到达目标格子的步数为：到达上边格子的步数 ＋ 到达左边格子的步数。可以用递推式

dp[i][j] = dp[i-1][j] + dp[i][j-1] 求得。

代码如下：

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