大彪哥
<?php
/**
* for 循环算法
*/
function loop($num){
$arr = [1,1,2,3,5,8,13,21,34];
for ($i=0;$i<$num;$i++){
$arr[$i+2] = $arr[$i+1] + $arr[$i];
}
return $arr[$num-1];
}
print_r(loop(30));
/**
* for 递归算法
*/
function recursion($num){
// $arr = [1,1,2,3,5,8,13,21,34];
if($num <=0){
return 0;
}elseif ($num>0 && $num<=2){
return 1;
}else{
return recursion($num-1)+recursion($num-2);
}
}
print_r(recursion(30));
