Java基于高精度整型实现fibonacci数列的方法

package com.java.learning.recursion;import java.math.*;public class MainClass {  public static void main(String args[]){    for(int i = 0; i < 100; i++){      f(i+1);    }  }     public static BigInteger f(long n){    if(n <= 2){      return new BigInteger("1");    }else{      BigInteger n1 = new BigInteger("1");      BigInteger n2 = new BigInteger("1");      BigInteger temp = new BigInteger("0");             for(long i = 0; i < n -2; i++){        temp = n1.add(n2);        n1 = n2;        n2 = temp;      }      System.out.println("第" + n + "项为：" + n2);      return n2;    }  }}