How to realize Fibonacci sequence in java

This article mainly explains "how to realize the Fibonacci sequence in java". Interested friends may wish to have a look. The method introduced in this paper is simple, fast and practical. Let's let the editor take you to learn how to realize the Fibonacci series in java.

The Fibonacci series means that the latter term of the series is equal to the sum of the first two terms, and we use a [I] = a [I-1] + a [I-2] in the code.

The problem of typical rabbits giving birth to rabbits

Classical problem: there is a pair of rabbits that give birth to a pair of rabbits every month from the third month after birth, and the bunnies grow up to give birth to another pair every month after the third month. Assuming that each pair of rabbits does not die, the number of rabbits per month is calculated by programming.

Code example:

Core code, Fibonacci series (the latter is equal to the sum of the first two):

PublicstaticvoidgetTuTu (int [] tutu,intn) {

If (naughty 1) {

System.out.println ("the number of rabbits in the first month is 1")

} elseif (naughty 2) {

System.out.println ("the number of rabbits in the second month is 1")

} else {

Tutu [0] = 1

Tutu [1] = 1

System.out.println ("the number of rabbits in the first month is 1")

System.out.println ("the number of rabbits in the second month is 1")

For (inti=2;i