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?
啊啊啊啊。。。这是什么鬼呢。。。
n/2,n%2,余的就是一定是1的,然后2的就是,可以是一个2,也可以是1+1,哈哈哈哈,机智如我
然而。。。
class Solution {
public:
int climbStairs(int n) {
if (n == 0 || n == 1)
return 1;
int pre = 1;
int current = 1;
for(int i = 2; i <= n; i++)
{
int temp = current + pre;
pre = current;
current = temp;
}
return current;
}
};
一步两步。。。似魔鬼的步伐。。。