n<=39
class Solution {
public:
int Fibonacci(int n) {
if(n<=1){
return n;
}
int record[50];
record[0]=0;
record[1]=1;
for(int i=2;i<=n;i++){
record[i]=record[i-1]+record[i-2];
}
return record[n];
}
};
public
class
Solution {
public
int
Fibonacci(
int
n) {
int
preNum=
1
;
int
prePreNum=
0
;
int
result=
0
;
if
(n==
0
)
return
0
;
if
(n==
1
)
return
1
;
for
(
int
i=
2
;i<=n;i++){
result=preNum+prePreNum;
prePreNum=preNum;
preNum=result;
}
return
result;
}
}
class Solution {public:int Fibonacci(int n) {int arr[39];arr[0]=0;arr[1]=1;if (n<2){return arr[n];}for(int i=2;i<=n;i++){arr[i]=arr[i-1]+arr[i-2];}return arr[n];}};
联系客服