//斐波那契数列
/**
* n=1,f(1)=1;
* n=2,f(2)=1;
* n=3,f(3)=2;
* n=4,f(4)=3;
* n=5,f(5)=5;
* ...
* n=n,f(n)=f(n-2)+f(n-1)
*
*/
/**
* 递归实现
* @param $n
* @return bool|int
*/
function fibonacciSequence($n)
{
if ($n == 0){
return false;
}
if ($n == 1 || $n == 2){
return 1;
}
$sum = fibonacciSequence($n - 2) + fibonacciSequence($n - 1);
return $sum;
}
/**
* 数组实现
* @param $n
* @return mixed
*/
function fibonacciSequenceArray($n)
{
$array = array();
$array[0] = 1;
$array[1] = 1;
for ($i = 2; $i < $n; $i++){
$array[] = $array[$i - 2] + $array[$i - 1];
}
return $array[$n - 1];
}
echo fibonacciSequence(25);