Climbing Stairs

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?

题目解析：

主要是fibonnaci数列的非递归结果。

int climbStairs(int n) {
	if(n == 0)
		return 1;
	if(n == 1)
		return 1;
	int result = 0;
	int lastValue=1;
	int lastlastValue=1;
	for(int i = 2;i<=n;i++)
	{
		result = lastValue+lastlastValue;
		lastlastValue = lastValue;
		lastValue = result;
	}

	return result;
}

下面的代码是自己写的，

前面一直是对的，但是到38的时候 我的结果是63245985，正确是63245986.。具体什么原因还没查出来

#include <iostream>

using namespace std;

float caculateArrange(int m,int n)
{
	if(m ==0 && n==0)
		return 1;

	float denominator = 1;
	float numerator = 1;
	for(int k=0;k<n;k++)
	{
		numerator = numerator*(m-k);
		denominator = denominator*(n-k);
	}

	return numerator/denominator;
}

int climbStairs(int n) {
	if(n==0)
		return 0;
	if(n==1)
		return 1;
	if(n==2)
		return 2;

	int diffKinds = 0;
	diffKinds = diffKinds + 1;//all is one

	if(n%2 == 0)
	{
		diffKinds = diffKinds + 1;//all is two;
	}else{
		diffKinds = diffKinds + n/2 + 1;//only one is one
	}

	for(int i = 1;i<=(n/2-1);i++) //i represents the number of two
	{
		int leftOne = n - 2*i;

		for(int j=1;j<=i;j++)
		{
			diffKinds = diffKinds + caculateArrange(leftOne+1,j)*caculateArrange(i-1,j-1);
		}
	}

	return diffKinds;
}

int fibonnaci(int n)
{
	if(n == 0)
		return 1;
	if(n == 1)
		return 1;
	int result = 0;
	int lastValue=1;
	int lastlastValue=1;
	for(int i = 2;i<=n;i++)
	{
		result = lastValue+lastlastValue;
		lastlastValue = lastValue;
		lastValue = result;
	}

	return result;
}

int main(void)
{
	bool flag = true;
	int n = 2;
	while(climbStairs(n)==fibonnaci(n))
	{
		n++;
	}

	cout << n << endl;
	cout << climbStairs(n) << " : " << fibonnaci(n) << endl;
	system("pause");
	return 0;
}