Fibonacci 数列求和

public class Fibonacci { /** * 递归 * @param n * @return */ public static int fractor(int n){ if(n==1){ return 1; } if(n==2){ return 2; } if(n>2){ return fractor(n-1)+fractor(n-2); } return 0; } /** * 迭代 * @param n * @return */ public static int fractor1(int n){ int frac1=0; int frac2=1; int frac=0; while(n>0){ frac=frac1+frac2; frac1=frac2; frac2 = frac; n--; } return frac2; } public static void main(String[] args){ System.out.println(fractor1(70)); System.out.println(fractor(70)); } }