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.

Hide Tags

  Array Dynamic Programming

Have you met this question in a real interview?

解法：动态规划

对于给定的m和n，申请m行n列的数组arr[m][n]。其中arr[i][j]表示从（0，0）到（i，j）有多少种路径，最后的结果arr[m-1][n-1]

第一行，第一列的值初始化为1，对其余的行列，进行如下运算：

arr[i][j]=arr[i-1][j]+arr[i][j-1]

class Solution {
public:
    int uniquePaths(int m, int n) {
        if(m<1||n<1)
            return 0;
        else if(m==1||n==1)
            return 1;
        else{
            int **arr=new int*[m];
            for(int i=0;i<m;i++)
            {
                arr[i]=new int[n];
                memset(arr[i],0,sizeof(int)*n);
            }
            
            for(int i=0;i<m;i++)
                for(int j=0;j<n;j++)
                {
                    if(i==0&&j==0)
                        arr[i][j]=1;
                    else if(i==0&&j!=0)
                        arr[i][j]=1;
                    else if(i!=0&&j==0)
                        arr[i][j]=1;
                    else
                        arr[i][j]=arr[i-1][j]+arr[i][j-1];
                }
                
            return arr[m-1][n-1];
        }
        
    }
};