斐波那契数列以如下被以递推的方法定义:F(1)=1,F(2)=1, F(n)=F(n - 1)+F(n - 2)(n ≥ 3,n ∈ N*)
其代码如下:
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8" />
<title></title>
<!-- <script src="https://unpkg.com/vue@next"></script> -->
<script src="js/v2.6.10/vue.js" type="text/javascript" charset="utf-8"></script>
</head>
<body>
<div id="app">
<input type="text" v-model="input" />
<br/>
<button @click="cal()" type="button" value="">计算</button>
</div>
<script type="text/javascript">
let v = new Vue({
el:'#app',
data:{
input:null
},
methods:{
cal: function (){
var i,n1=1,n2=2,sum=0;
if(this.input!=1&&this.input!=2){
for(i=3;i<=this.input;i++){
sum = n1+n2;
n1=n2;
n2=sum;
}alert("斐波那契数列的结果为:"+sum);
}else{
alert("斐波那契数列的结果为:"+this.input);
}
}
}
})
</script>
</body>
</html>