JavaScript之斐波那契数列的几种实现方法兔子数列黄金分割数列递归for解构

Posted 2022-02-08 web半晨

目录

• 1、递归实现
• 2、for循环+解构实现
• 3、相关链接

---

1、递归实现

function fibonacciSequenceRecursion(n) 
	n = Number(n);
	if (!n) return alert('请正确输入值');
	if (n == 1 || n == 2) return 1;
	return fibonacciSequenceRecursion(n - 2) + fibonacciSequenceRecursion(n - 1);


console.log(fibonacciSequenceRecursion(1)); // 1
console.log(fibonacciSequenceRecursion(2)); // 1
console.log(fibonacciSequenceRecursion(3)); // 2
console.log(fibonacciSequenceRecursion(4)); // 3
console.log(fibonacciSequenceRecursion(5)); // 5
console.log(fibonacciSequenceRecursion(6)); // 8
console.log(fibonacciSequenceRecursion(7)); // 13

---

2、for循环+解构实现

function fibonacciSequenceFor(n) 
	n = Number(n);
	if (!n) return alert('请正确输入值');

	if (n <= 2) return 1;

	let a = 1,
		b = 1;

	for (let i = 2; i < n; i++) [a, b] = [b, a + b];

	return b;


console.log(fibonacciSequenceFor(1)); // 1
console.log(fibonacciSequenceFor(2)); // 1
console.log(fibonacciSequenceFor(3)); // 2
console.log(fibonacciSequenceFor(4)); // 3
console.log(fibonacciSequenceFor(5)); // 5
console.log(fibonacciSequenceFor(6)); // 8
console.log(fibonacciSequenceFor(7)); // 13

---

3、相关链接

3.1、CSDN-JavaScript写斐波那契数列的几种方式
3.2、博客园-JS写斐波那契数列的几种方法