数据结构--爬楼梯

递归

int Fib(int n)
{
	if(n == 1 || n == 2)
		return n;
	else
		return Fib(n - 1) + Fib(n - 2);
}

非递归

int jumpStairs(int n)
{
	if(n == 1 || n == 2)
		return n;
	int s1 = 1, s2 = 2, s3;
	for(int i = 3; i <= n; i++)
	{
		s3 = s1 + s2;
		s1 = s2;
		s2 = s3;
	}
	return s3;
}