LeetCode--62. Unique Paths

62. Unique Paths

Description：

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.

Solution：

其实用数学的方法最简单，从[1][1]到达[m][n]处，一共需要走m+n-2步即可达到，即纵向走m-1步，横向走n-1步，所以所有路径数为：从（m+n-2）中选（m-1）= 从（m+n-2）中选（n-1）= (m+n-2)!/[(m-1)! * (n-1)!]。

此处选用动态规划的方法：将第一行、第一列都标记为1，P[i][j] = P[i-1][j] + P[i][j-1]，此时P[m][n]即为所求。

Code：

class Solution {
public:
    int uniquePaths(int m, int n) {
        int P[101][101];
        P[1][1]=1;
        for (int i=2; i<=n; i++)
        {
            P[1][i]=1;
        }
        for (int i=2; i<=m; i++)
        {
            P[i][1]=1;
        }
        for (int i=2; i<=m; i++)
        {
            for (int j=2; j<=n; j++)
            {
                P[i][j]=P[i-1][j]+P[i][j-1];
            }
        }
        return P[m][n];
    }
};

62 .  Unique Paths