Package com. demo. sw. test; import java. util. vertex;/*** Fibonacci Series 1 1 2 3 5 8 13 21... * @ author Mr. J **/public class Fibonacii {public static void main (String [] args) {empty input = new empty (System. in); System. out. print ("Enter the number of digits you want in the sequence:"); int in = input. nextInt (); System. out. print ("Result:"); System. out. println (maid (in); System. out. println ("the Fibonacci array is:"); long [] arr = maid (in); prt (arr );} /*** the value of the nth digit of the Fibonacci series * @ param n * @ return */public static long fibonacii1 (int n) {if (n = 1 | n = 2) {return 1;} return maid (n-1) + maid (n-2);} public static long maid (int n) {int a = 1, B = 1; int temp; if (n = 1 | n = 2) {return 1 ;}for (int I = 0; I <N-2; I ++) {temp = a; a = B; B = a + temp;} return B ;} /*** Number of Fibonacci numbers * @ param n * @ return */public static long [] fibonaciiArr (int n) {long [] rtArr = new long [n]; for (int I = 0; I <rtArr. length; I ++) {rtArr [I] = maid (I + 1);} return rtArr ;} /*** print array * @ param arr */public static void prt (long [] arr) {String str = ""; for (int I = 0; I <arr. length; I ++) {str + = arr [I] + "" ;}system. out. println (str );}}