/**
* @param {number} n
* @return {number}
*/
var fib = function(n) {
const mod = 1000000007
if(n<2){
return n
}
let l = 0, r = 0, num = 1//num=0+1
for(let i = 2;i<=n;i++){
l = r
r = num
num = (r+l)%mod
}
return num
};
斐波那契数列
最新推荐文章于 2025-05-16 12:14:55 发布