LeetCode 之 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 构造递归式：path(m,n)=path(m-1,n)+path(m.n-1)，机器人在每个坐标的可以行动的路线都是由向右和向下两种方法构成，返回和即可，另外还要考虑是否到达右边界和下边界

2 利用自顶向下，采用一个数组来记录每个坐标的path值

代码如下：（12 ms）

class Solution {
public:
    int uniquePaths(int m, int n) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        
        //记录在坐标x,y时的路径数
        int record [100][100] = {-1};
        return path(0,0,m-1,n-1,record);
    }
    
    int path(int x , int y , int m , int n , int record[][100]){
        if(record[x][y]>0) return record[x][y];
        int result;
        //到达终点，返回1
        if(x==m && y==n){
            return 1;
        }
        else if(x==m){
            //到达右边界，y+1
            result = path(x,y+1,m,n,record);
        }
        else if(y==n){
            //到达下边界，x+1
            result = path(x+1,y,m,n,record);
        }
        else{
            //关键！！！构造递归式的核心
            result = path(x+1,y,m,n,record) + path(x,y+1,m,n,record);
        }
        //记录该路径数
        record[x][y] = result;
        return result;

    }
};