mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-28 06:55:02 +08:00
Change project structure to a Maven Java project + Refactor (#2816)
This commit is contained in:

committed by
GitHub

parent
8e533d2617
commit
9fb3364ccc
34
src/main/java/com/thealgorithms/others/FibbonaciSeries.java
Normal file
34
src/main/java/com/thealgorithms/others/FibbonaciSeries.java
Normal file
@ -0,0 +1,34 @@
|
||||
package com.thealgorithms.others;
|
||||
|
||||
import java.util.Scanner;
|
||||
|
||||
/**
|
||||
* Fibonacci sequence, and characterized by the fact that every number after the
|
||||
* first two is the sum of the two preceding ones.
|
||||
*
|
||||
* <p>
|
||||
* Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,...
|
||||
*
|
||||
* <p>
|
||||
* Source for the explanation: https://en.wikipedia.org/wiki/Fibonacci_number
|
||||
*
|
||||
* Problem Statement: print all Fibonacci numbers that are smaller than your
|
||||
* given input N
|
||||
*/
|
||||
public class FibbonaciSeries {
|
||||
|
||||
public static void main(String[] args) {
|
||||
// Get input from the user
|
||||
Scanner scan = new Scanner(System.in);
|
||||
int n = scan.nextInt();
|
||||
int first = 0, second = 1;
|
||||
scan.close();
|
||||
while (first <= n) {
|
||||
// print first fibo 0 then add second fibo into it while updating second as well
|
||||
System.out.println(first);
|
||||
int next = first + second;
|
||||
first = second;
|
||||
second = next;
|
||||
}
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user