leetcode系列62-不同路径

【题目概要】

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?

【思路分析】

1. 任何一点到达的前一步，从上往下，从左往右，因此n,m = n-1,m + n, m-1
2. 在左边和上边边界的时候即只能有一种情况

【代码示例】

int uniquePaths(int m, int n){
    int **re = (int**)malloc(sizeof(int*)*n);
    for(int i=0; i<n; i++)
    {
        re[i] = (int*)malloc(sizeof(int)*m);
    }
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<m; j++)
        {
            if(i == 0 || j == 0)
            {
                re[i][j] = 1;
            }
            else
            {
                re[i][j] = re[i-1][j] + re[i][j-1];
            }
        }
    }
    return re[n-1][m-1];
}