class Solution {
public int Fibonacci(int n) {
int num1 = 0;
int num2 = 1;
if(n == 0 || n == 1) {
return n;
}
int temp = 0;
for(int i = 2; i <= n; i++) {
temp = num1+num2;
num1 = num2;
num2 = temp;
}
return temp;
}
}
注意要看https://www.acwing.com/blog/content/25/