递归两行代码
public class Solution {
public int Fibonacci(int n) {
if(n<=2){
return 1;
}
return Fibonacci(n-1)+Fibonacci(n-2);
}
}

public class Solution {
public int Fibonacci(int n) {
if(n<=2){
return 1;
}
return Fibonacci(n-1)+Fibonacci(n-2);
}
}