Fibonacci for biginteger

import java.math.BigInteger;
import java.util.Scanner;

public class FibonacciRecursion {

    public static BigInteger fibonacci(int n) {
        if (n == 1 || n == 2) {
            return BigInteger.ONE;

        }else if(n==0){
            return BigInteger.ZERO;
        }
        else {
            return (fibonacci(n - 1).add(fibonacci(n - 2)));
        }

    }


    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        BigInteger ans = fibonacci(n);
        System.out.println(ans);
    }

}

Similar codes

0 vote264 views2 answers
Hulu
Java
0 vote198 views1 answer
Valid parentheses leetcode solution java
Java
0 vote194 views1 answer
Interface in solidity
Java
0 vote271 views1 answer
How to show the hex detail of a file in java
Java
0 vote186 views1 answer
Gcd = 1
Java
0 vote190 views1 answer
Add pd4j to application
Java
3 votes191 views1 answer
Padding a string with 0 in java
Java
2 votes184 views1 answer
Primefaces custom validator
Java
0 vote331 views1 answer
Check first character of string is number java
Java
0 vote191 views2 answers
Package javafx.fxml does not exist
Java