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

class Solution {//DP fibonacci sequence//alternative solution: matrix multiply for O(logn)public:	int climbStairs(int n) {		// Start typing your C/C++ solution below		// DO NOT write int main() function		vector
   
     f(n+1);		f[0] = 1; f[1] = 1;		for (int i = 2; i <= n; ++i)			f[i] = f[i-1]+f[i-2];		return f[n];	}};
   

second time;

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

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