标签:style blog io ar java sp on 2014 log
斐波那契数列算法的快速版本function f(n) { if(n==1 || n == 2){return 1;} if(n%2 == 0){ var k = n/2; return f(k)*(2*f(k+1) - f(k)); } else{ var k = (n-1)/2; return f(k+1) * f(k+1) + f(k) * f(k); } } console.log(f(1000));
标签:style blog io ar java sp on 2014 log
原文地址:http://blog.csdn.net/lan_liang/article/details/40825863