weixin_43382336的博客

原创 斐波那契额数列几种实现-递归实现-for实现

for实现斐波那契数列 var num1 = 1; var num2 = 1; var sum = 0; for(var i=3;i<=12;i++){ sum = num1 + num2; num1 = num2; num2 = sum; } console.log(sum);//144 递归实现斐波那契数列 public static int ...