【leetcode】Unique Paths

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?

用排列组合的方法做，总的可能性为$C_{m+n}^n$，但是会导致内存溢出，基本的方法为：

class Solution {
public:
    int uniquePaths(int m, int n) {
        int answer;
        if(m==0&&n==0) return 0;
        if(m==0||n==0) return 1;

        int temp1=1,temp2=1;
        for(int i=m+n;i>n;i--)
        {
            temp1=temp1*i;
        }
        printf("%d\n",temp1);
        for(int j=1;j<=m;j++)
        {
            temp2=temp2*j;
        }
        printf("%d\n",temp2);
        answer=temp1/temp2;
        return answer;
    }
};

换一个思路，如果用递归的方法来做，就比较简单了，但是时间复杂度为$O(n^4)$，超出时间限制；

class Solution {
public:
    int uniquePaths(int m, int n) {
        int answer;
        if(m<=0&&n<=0) return 0;
        if(m==1||n==1) return 1;

    return uniquePaths(m-1, n) + uniquePaths(m, n-1);
    }
};

动态规划的算法，时间复杂度为$O(N^2)$

class Solution {
public:
    int uniquePaths(int m, int n) {
        if(m<=0&&n<=0) return 0;
        if(m==1||n==1) return 1;

        vector<int> f(n,0);
        f[0]=1;
        for(int i=0;i<m;i++)
        {
            for(int j=1;j<n;j++)
            {
                f[j]=f[j-1]+f[j];
            }
        }
        return f[n-1];
    }
};