[Java] 재귀 - 피보나치

private static int Fibonnaci(int n) {
  if(n>=2) {
  	if(arr[n] != -1) return arr[n];
  }

  return Fibonnaci(n-1) + Fibonnaci(n-2);
}

public static void main(String[] args) {
  arr[0] = 0;
  arr[1] = 1;

  System.out.println(Fibonnaci(10));
}