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?

Above is a 3 x 7 grid. How many possible unique paths are there?
Note: m and n will be at most 100.

思路：这题有种最简单的方法就是用排列组合做，因为行走方式是固定的，对于m行n列的矩阵，相当于从m+1的位置中选出n个空隙，把这n个结果插进去，$C_{m+1}^n$ 就是最后的结果。当然，也可以用动态规划的方法，建立一个数组，数组大小为m×n，数组第一列和第一行赋1，之后就可以用d[i][j]=d[i-1][j]+d[i][j-1]求解：

class Solution {
public:
    int uniquePaths(int m, int n) {
        int result[m][n];
        for (int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if (i==0 or j==0)
                    result[i][j] = 1;
                else
                    result[i][j]=result[i-1][j]+result[i][j-1];
            }
        }
        return result[m-1][n-1];
    }
};

网上还有只利用一个数组求解的方法，原理是一样的：

class Solution {
    int uniquePaths(int m, int n) {
        if (m > n) return uniquePaths(n, m);
        vector<int> cur(m, 1);
        for (int j = 1; j < n; j++)
            for (int i = 1; i < m; i++)
                cur[i] += cur[i - 1]; 
        return cur[m - 1];
    }
};