Fibonacci

001

import java.util.ArrayList;
import java.util.Scanner;

public class Fibonacci {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("Input length:");
        int length = sc.nextInt();
        ArrayList<Integer> arr = new ArrayList<>();
        int sum = 0;
        arr.add(0);
        arr.add(1);
        switch (length) {
            case 1:
                System.out.println("0");
                break;
            case 2:
                System.out.println("0 1");
                break;
            default:
                System.out.print("0 1 ");
                for (int i = 2; i <= length - 1; i ++) {
                    arr.add(arr.get(i - 1) + arr.get(i - 2));
                    System.out.print(arr.get(i) + " ");
                }
        }
    }
}

Input length:
10
0 1 1 2 3 5 8 13 21 34