1,1,2,3,5,8,,,,,,,,
递归实现:
int FibonacciFunc(int arr[n])
{
if( arr[n-1]==1&&arr[n-2]==1 ){
return 1;
}
return FibonacciFunc(arr[n-1])+FibonacciFunc(arr[n-2])
}
标签:arr,return,数列,递归,int,斐波,那契,FibonacciFunc From: https://blog.51cto.com/u_15859002/5821995