피보나치 동적계획법 소스

http://nikhilkh.blogspot.kr/2012/04/dynamic-programming-beast-is-coming-run.html

package Algoexam;

public class FiboDynamic {

public  int fibo(int n){

int [] table = new int [n+1];// n 이면 아웃오브 인덱스 뜬다 

 

for(int i=0; i<table.length;i++){

if(i==0){

table[i]=1;

}else if(i==1){

table[i]=1;

}else{

table[i]=table[i-2]+table[i-1];

}

}

return table[n];

}

public int fibo1(int n){

 

if(n<=1){

return 1;

}

else{

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

}

 

}

 

public static void main(String[] args) {

FiboDynamic f = new FiboDynamic();

 

int result1=0;

int result2=0;

result1=f.fibo(5);

//result2=f.fibo1(5);

System.out.println(result1);

//System.out.println(result2);

 

}

}