Dynamic Fibonacci

DynamicFibonacci.java

public class DynamicFibonacci {
  int[] fibs;
  
  public static void printFibsUpToN(int n)
  {
    fibs[n] = new int[n + 1]
    
  }
  
  public int fib(int n)
  {
    if(n <= 1)
      return 0;
    else if(n == 1) 
      return 1;
    else if(fibs[n] > 0) 
      return fibs[n];
    fibs[n] = fib(n - 1, memo) + fib(n - 2, memo);
  }
}