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 int climbStairs(int n)
{
int sum = 0;
int a = 0;
int b = 1;
for (int i = 1; i <= n; i++)
{
sum = a + b;
a = b;
b = sum;
}
return sum;
}