Java method for realizing Fibonacci sequence based on high precision integer type _java

In this paper, we describe the method of Java based on high precision integer type to realize Fibonacci sequence, and share it for everyone's reference. The specific methods are as follows:

Package com.java.learning.recursion;
Import java.math.*;
public class MainClass {public
  static void Main (String args[]) {for
    (int i = 0; i < 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 ("The first" + N + "item is:" + n2);
      return n2;
    }
  }

I hope this article will help you with your Java programming.