1 class Solution {
2 public:
3 int uniquePaths(int m, int n) {
4 // Start typing your C/C++ solution below
5 // DO NOT write int main() function
6 vector > f(m, vector(n));
7
8 for(int i = 0; i < n; i++)
9 f[0][i] = 1;
10
11 for(int i = 0; i < m; i++)
12 f[i][0] = 1;
13
14 for(int i = 1; i < m; i++)
15 for(int j = 1; j < n; j++)
16 f[i][j] = f[i-1][j] + f[i][j-1];
17
18 return f[m-1][n-1];
19 }
20 };
