斐波那契数列 Java 使用递归和循环程序

在算术中，Wythoff 数组是由斐波那契数列得到的无限数字矩阵。

The Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, ...

斐波那契数列程序 Java 使用 For 循环

//Using  For Loop
public class FibonacciExample {
	public static void main(String[] args) 
	{
		// Set it to the number of elements you want in the Fibonacci Series
		 int maxNumber = 10; 
		 int previousNumber = 0;
		 int nextNumber = 1;
	        System.out.print("Fibonacci Series of "+maxNumber+" numbers:");
	        for (int i = 1; i <= maxNumber; ++i)
	        {
	            System.out.print(previousNumber+" ");
	            /* On each iteration, we are assigning second number
	             * to the first number and assigning the sum of last two
	             * numbers to the second number
	             */
 
	      
	            int sum = previousNumber + nextNumber;
	            previousNumber = nextNumber;
	            nextNumber = sum;
	        }
	}
}

输出：

Fibonacci Series of 10 numbers:0 1 1 2 3 5 8 13 21 34

程序逻辑：

• previousNumber 初始化为 0，nextNumber 初始化为 1
• 斐波那契数列 For 循环遍历 maxNumber
• 显示前一个号码
• 计算 previousNumber 和 nextNumber 的总和
• 更新 previousNumber 和 nextNumber 的新值

斐波那契数列程序 Java 使用 While 循环

您还可以生成 Java 斐波那契数列使用 While 循环 Java

//Using  While Loop
public class FibonacciWhileExample {
	public static void main(String[] args) 
	{
		 int maxNumber = 10, previousNumber = 0, nextNumber = 1;
	        System.out.print("Fibonacci Series of "+maxNumber+" numbers:");
 
	        int i=1;
	        while(i <= maxNumber)
	        {
	            System.out.print(previousNumber+" ");
	            int sum = previousNumber + nextNumber;
	            previousNumber = nextNumber;
	            nextNumber = sum;
	            i++;
	        }
 
	}
 
}

输出：

Fibonacci Series of 10 numbers:0 1 1 2 3 5 8 13 21 34

程序逻辑上的唯一区别是使用 WHILE 循环 打印斐波那契 Numbers

根据用户输入的斐波那契数列

//fibonacci series based on the user input
import java.util.Scanner;
public class FibonacciExample {
 
	public static void main(String[] args) 
	{
	
		 int maxNumber = 0; 
		 int previousNumber = 0;
		 int nextNumber = 1;
		 
		    System.out.println("How many numbers you want in Fibonacci:");
	        Scanner scanner = new Scanner(System.in);
	        maxNumber = scanner.nextInt();
	        System.out.print("Fibonacci Series of "+maxNumber+" numbers:");
 
	        for (int i = 1; i <= maxNumber; ++i)
	        {
	            System.out.print(previousNumber+" ");
	            /* On each iteration, we are assigning second number
	             * to the first number and assigning the sum of last two
	             * numbers to the second number
	             */
 
	      
	            int sum = previousNumber + nextNumber;
	            previousNumber = nextNumber;
	            nextNumber = sum;
	        }
 
	}
 
}

程序逻辑：
逻辑与之前相同。无需对要显示的元素数量进行硬编码 Java 斐波那契数列，要求用户写下数字。

斐波那契数列使用递归 Java

下面是一个斐波那契数列程序 Java 使用递归：

//Using Recursion
public class FibonacciCalc{
	public static int fibonacciRecursion(int n){
	if(n == 0){
		return 0;
	}
	if(n == 1 || n == 2){
			return 1;
		}
	return fibonacciRecursion(n-2) + fibonacciRecursion(n-1);
	}
    public static void main(String args[]) {
	int maxNumber = 10;
	System.out.print("Fibonacci Series of "+maxNumber+" numbers: ");
	for(int i = 0; i < maxNumber; i++){
			System.out.print(fibonacciRecursion(i) +" ");
		}
	}
}

Fibonacci Series of 10 numbers: 0 1 1 2 3 5 8 13 21 34

程序逻辑：

递归函数是具有调用自身的能力的函数。

fibonacciRecursion（）：

1. 此 Java 斐波那契递归函数接受一个输入数字。检查 0、1、2 并相应地返回 0、1、1，因为斐波那契数列 Java 以 0, 1, 1 开始。
2. 当输入 n >=3 时，函数将递归调用自身。调用两次。让我们看看斐波那契数列 Java 使用递归示例输入 4。

fibonacciRecursion (4)  
	It will recursively call fibonacciRecursion function for values 2 and 3
		fibonacciRecursion (2) \\ call for value 0 and 1
			fibonacciRecursion (0) = 0
			fibonacciRecursion (1) = 1
		fibonacciRecursion (3) \\ It will call for 1 and 2
			fibonacciRecursion (1) = 1
			fibonacciRecursion (2) \\ It will call for 0 and 1
				fibonacciRecursion (0) = 0
				fibonacciRecursion (1) = 1

现在结果是 0+1+1+0+1=3