案例(3):斐波那契Fibonacci数列: 1,1,2,3,5,8,13 ...前两项都是1,后面项等于前两项之和
显示前n个斐波那契Fibonacci数列
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Document</title>
<!--
3.斐波那契Fibonacci数列: 1,1,2,3,5,8,13 ...前两项都是1,后面项等于前两项之和
显示前n个斐波那契Fibonacci数列
-->
</head>
<body>
<script>
var first = 1 //第一项1
var two = 1 //第二项1
var sum = first + two //第三项值为第一项+第二项
document.write(first + ' ' + two + ' ' + sum + ' ')
function Fibonacci(n) {
for (var i = 4; i < n; i++) {
first=two //从第四项开始,把后一项的值赋给前一项
two=sum
sum=first+two
document.write(sum+ ' ')
}
}
Fibonacci(14)
</script>
</body>
</html>