Cacher is the code snippet organizer for pro developers

//大家都知道斐波那契数列，现在要求输入一个整数n，请你输出斐波那契数列的第n项。
//n<=39



int Fibonacci(int n) {
	if(n == 0)
	    return 0;
	if(n == 1)
	    return 1;
	int num1 = 0, num2 = 1;
	int numLast;
	for(int i=2; i<=n; ++i) {
	    numLast = num1+num2;
	    num1 = num2;
	    num2 = numLast;
	}
	return numLast;
}