面试题斐波那契数列

<?php/** * Created by PhpStorm. * User: 夏骏 * Date: 2017/3/14 * Time: 16:16 */function Fb($n){    if(is_int($n)&&$n>0) {        $shulie = array();        for ($i = 0; $i < $n; $i++) {            if ($i == 0 || $i == 1) {                $shulie[$i] = 1;            } else {                $shulie[$i] = $shulie[$i - 1] + $shulie[$i - 2];            }        }        return $shulie;    }else{        return '请输入正整数';    }}

//用数组完成数列的打印function fbnq($n){    if($n <= 0) '请输入正整数';    if($n == 1 || $n == 2) return 1;    return fbnq($n - 1) + fbnq($n - 2);}//递归的找出最后一个的值