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?

这道题目经过分析就可以知道其实还是蛮简单的，从左上角到达右下角的总的路径总数，其中每一次只能往右走或者往下走，这样的话可以用一个矩阵来存储到达每一个节点的路径的总的方法，每一个节点的到达路径数依赖于左边和上边的节点，因此只要计算除左边或者上边的节点的路径数就可以计算出来了

以下是程序：

class Solution {
public:
    int uniquePaths(int m, int n) {
        int **arr;
        arr = new int*[m];
        for (int i = 0; i < m; i++)
            arr[i] = new int[n];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                arr[i][j] = 0;
                if (i == 0)
                    arr[i][j] = 1;
                if (j == 0)
                    arr[i][j] = 1;
            }
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                arr[i][j] = arr[i - 1][j] + arr[i][j - 1];
            }
        }
        int num = arr[m-1][n-1];
        for (int i = 0; i < m; i++)
            delete []arr[i];
        delete []arr;
        return num;
    }
};

程序的时间复杂度位O(m * n), 空间复杂度也是O(m * n)