标签:can tair ica ret iss art height font tin
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
//设f(n)表示爬n阶楼梯的不同方法,有两种选择: //1.从第n-1阶,前进1步到达第n阶。 //2.从第n-2阶,前进2步到达第n阶;因此有递推关系f(n)=f(n-1)+f(n-2),这就是一个斐波那契数列 //利用迭代的方法: class Solution { public: int climbStairs(int n) { if (n <= 2) return n; else { int *f = new int[n]; f[0] = 1; //一个台阶的方法为1 f[1] = 2; //两个台阶的方法为2 for (int i = 2; i < n; i++) { f[i] = f[i - 1] + f[i - 2]; } return f[n - 1]; //f[n-1]即n个台阶的方法 } } };
标签:can tair ica ret iss art height font tin
原文地址:http://www.cnblogs.com/cynchanpin/p/7258401.html