求 斐波那契数列第n值 [0,1,1,2,3,5,8,13,21,34,55] fn(-1) = 0 ; fn(0) = 0; fn(1) = 1; fn(2) = 1; fn(3) = 2; fn(10)=55 解法一:递归 时间复杂度O(2 ^ n) fn(n:number):number{ if(n <== 0) return 0 if