Java - Math - Recursion - Fibonacci Series(Basic Version)

Basic Recursion

public class Fibonacci {

public static int fibonacciRecursion(int n) {

if (n <= 2) {

return n - 1;

}

return fibonacciRecursion(n - 1) + fibonacciRecursion(n - 2);

}

public static void main(String args[]) {

int maxNumber = 11;

System.out.print("Fibonacci Series of " + maxNumber + " numbers: ");

for (int i = 1; i < maxNumber; i++) {

System.out.println(fibonacciRecursion(i) + " ");

}

}

}

Baskic Forloop ver

class Solution {
    public int climbStairs(int n) {
        if(n == 1) return 1;
        int[] a = new int[n];
        a[0] = 1;
        a[1] = 2;

        for(int i = 2; i < n; i++){
            a[i] = a[i-1] + a[i-2];
        }
      return a[n-1];  
    }
}