RGAlex

O3. Recursive Fibonacci

Feb 3rd, 2021
116
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.72 KB | None | 0 0
  1. package ArraysMoreExercise;
  2.  
  3. import java.util.Scanner;
  4.  
  5. public class O3RecursiveFibonacci {
  6.     public static void main(String[] args) {
  7.         Scanner scanner = new Scanner(System.in);
  8.  
  9.         int number = Integer.parseInt(scanner.nextLine());
  10.         long[] fibonacci = new long[number];
  11.         if (number >= 1 && number <= 50) {
  12.             for (int i = 0; i < number; i++) {
  13.                 if (i <= 1) {
  14.                     fibonacci[i] = 1;
  15.                 } else {
  16.                     fibonacci[i] = fibonacci[i - 1] + fibonacci[i - 2];
  17.                 }
  18.             }
  19.             System.out.println(fibonacci[number - 1]);
  20.         } else {
  21.             System.out.println(number);
  22.         }
  23.     }
  24. }
  25.  
Advertisement
Add Comment
Please, Sign In to add comment