(Leetcode)62.Unique Paths(medium)

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?

这题的话其实就是爬楼梯的变形，只不过从一维的变到了二维的，因此储存的答案又int ans[100][100]来完成，首先完成第一行和第一列的初始化（全部为1，因为路径唯一），之后由两重循环计算ans[i][j]=ans[i-1][j]+ans[i][j-1]，返回ans[m-1][n-1]即为所求。
我的答案：

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