编程输出斐波那契序列的前50项

递归：
public class TestFbQ {
public static void main(String[] args) {
System.out.println(f(50));
}

public static long f(int n) {
if(n == 1 || n == 2) {
return 1;
}
else {
return f(n-2) + f(n-1);
}
}
}

非递归：
public class TestFb {
public static void main(String[] args) {
System.out.println(f(50));
}

public static long f(int n) {
if(n ==1 || n == 2) {
return 1;
}
else {
long n1 = 1,n2 = 1;
long temp = 0;
for(int i=0;i<n-2;i++) {
temp = n1 + n2;
n1 = n2;
n2 = temp;
}

return temp;
}
}
}