This article describes the method of implementing Fibonacci algorithm in Java. Share it for everyone for your reference. The details are as follows:
package com.yenange.test2; import java.util.Scanner; public class Fibonacci { private static Scanner input = new Scanner(System.in); public static void ma in(String[] args) { System.out.println("- -----------------------"); int num1 = 1; int num2 = 1; int temp, count; System.out.println( "Please enter which number you want to query is (>=2):"); count = input.nextInt(); System.out.println("The first number is: 1"); System.out.println ("The second number is: 1"); for (int i = 3; i <= count; i++) { temp = num2; num2 += num1; System.out.println("th" + i + " The number is: " + num2); num1 = temp; } System.out.println("----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- System.out.println("th" + count + "number is:" + cal(count)); System.out.println("--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- ----------"); int[] arr = new int[count]; arr[0] = 1; arr[1] = 1; for (int i = 2; i < arr.length; i++) { arr[i] = arr[i - 1] + arr[i - 2]; System.out.println("Th" + (i + 1) + "Number of:" + arr[i]) ; } } static int cal(int count) { if (count <= 2) { return 1; } return cal(count - 1) + cal(count - 2); } }It is hoped that this article is helpful to everyone's Java program design.