本文共 863 字，大约阅读时间需要 2 分钟。

class Solution {//DPpublic:	int uniquePaths(int m, int n) {		// Start typing your C/C++ solution below		// DO NOT write int main() function		vector
   
    
     > f(m+1, vector
     
      (n+1, 0));		f[1][1] = 1;		for (int i = 1; i <= m; ++i)		{			for (int j = 1; j <= n; ++j)			{				if(i == 1 && j == 1) continue;				f[i][j] = f[i-1][j]+f[i][j-1];			}		}		return f[m][n];	}};
     
    
   

second time

class Solution {public:    int uniquePaths(int m, int n) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        vector
   
    
      > f(m+1, vector
     
      (n+1, 0));        for(int i = 1; i <= m; ++i)        {            for(int j = 1; j <= n; ++j)            {                if(i == 1 && j == 1) f[i][j] = 1;                else f[i][j] = f[i-1][j]+f[i][j-1];            }        }        return f[m][n];    }};
     
    
   

转载地址：http://nhxti.baihongyu.com/