标签：style color io ar java for sp div c
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?
public class Solution {
public int climbStairs(int n) {
if(n<4)
{
return n;
}
int low=1;
int up=2;
int p;
for(int i=3;i<=n;i++)
{
p=low+up;
low=up;
up=p;
}
return up;
}
}标签：style color io ar java for sp div c
原文地址：http://blog.csdn.net/jiewuyou/article/details/39889731
