矩阵的方法没懂
public class Fibonacci {
public static int fibonacci(int n){
int a=0;
int b=1;
if(n==1)return 1;
int m=n/2;
for(int i=0;i<m;i++){
a=a+b;
b=a+b;
}
return 2*m==n?a:b;
}
public static int f(int n){
if(n==1) return 1;
else if(n==2) return 1;
return f(n-1)+f(n-2);
}
public static void main(String[] args) {
int n=4;
System.out.println(fibonacci(n));
System.out.println(f(n));
}
}