0
import java.util.Scanner;
public class Fibonacci {
public static void main(String[] args) throws PR1Exception {
int count = new Scanner(System.in).nextInt();
int[] fibonacciNumbers = calculateFibonacci(count);
// print result
System.out.print("Eingabe: " + count + " -> ");
for (int fibonacciNumber : fibonacciNumbers) System.out.print(fibonacciNumber + " ");
}
public static int[] calculateFibonacci(int n) throws PR1Exception {
if (n < 1) throw new PR1Exception();
int[] fibonacciNumbers = new int[n];
fibonacciNumbers[0] = 0;
int prev = 0, curr = 1;
for (int i = 1; i < n; i++) {
int tmpFibonacci = prev + curr;
fibonacciNumbers[i] = tmpFibonacci;
prev = curr;
curr = tmpFibonacci;
}
return fibonacciNumbers;
}
static class PR1Exception extends Exception {
public PR1Exception() {
System.err.println("Invalid number.");
}
}
}
Diese Antwort melden
Link
geantwortet
daniel.kuenkel
Schüler, Punkte: 455
Schüler, Punkte: 455