typescript/school/fibonacci.ts · 664 字节 · 下载原文
// 斐波那契数列 —— 经典递归练习(前 15 项 + 迭代版)
// Fibonacci sequence -- the classic recursion exercise
//
// 来源 / Source: Rosetta Code「Fibonacci sequence」JavaScript 条目(GFDL 1.2 / CC-BY-SA 3.0)
function fib(n: number): number {
if (n < 2) { return n; }
return fib(n - 1) + fib(n - 2);
}
function fibIter(n: number): number {
let a: number = 0;
let b: number = 1;
let i: number = 0;
while (i < n) {
const t: number = a + b;
a = b;
b = t;
i = i + 1;
}
return a;
}
for (let k: number = 0; k < 15; k++) {
println_int(fib(k));
}
println_int(fibIter(30));