代码改变世界

leetcode - Unique Paths

2013-10-31 16:57  张汉生  阅读(117)  评论(0)    收藏  举报

 

 1 class Solution {
 2 public:
 3     int uniquePaths(int m, int n) {
 4         // IMPORTANT: Please reset any member data you declared, as
 5         // the same Solution instance will be reused for each test case.
 6         if (m<=0 || n<=0)
 7             return 0;
 8         int * f = new int[n];
 9         for (int i=0; i<n; i++)
10             f[i] = 1;
11         for (int i=1; i<m; i++)
12             for (int j=1; j<n; j++){
13                 f[j] += f[j-1];
14             }
15         int rlt = f[n-1];
16         delete []f;
17         return rlt;
18     }
19 };