[java] 피보나치 수열

1. 반복문

	 public int  solution(int n) {
		int answer =0;
		
		int[] f = new int[n+1];
		f[0]=0;
		f[1]=1;
		for(int i=2; i<=n; i++){
			f[i]=f[i-1]+f[i-2];
		}
		
		
		  return f[n];
	     
	    }

 

2. 재귀

public int recursive(int n) {
		if(n==1 || n==0) return n;
		else  return recursive(n-1)+recursive(n-2);
	}

 

관련 문제

백준 피보나치 수

https://www.acmicpc.net/problem/2747

2747번: 피보나치 수

import java.util.*;

public class Main {
	
	 public int  solution(int n) {
		int answer =0;
		
		int[] f = new int[n+1];
		f[0]=0;
		f[1]=1;
		for(int i=2; i<=n; i++){
			f[i]=f[i-1]+f[i-2];
		}
		
		  return f[n]; 
	    }
	    
	public int recursive(int n) {
		if(n==1 || n==0) return n;
		else  return recursive(n-1)+recursive(n-2);
	}
	
	public static void main(String[] args) {
		Main T = new Main();
		Scanner sc = new Scanner(System.in);
		
		int str = sc.nextInt();
		System.out.println(T.recursive(str));
	
	
	}}