Leetcode 509) Fibonacci Number

29 Jul 2021 in Algorithms

내 답안

class Solution {
    public int fib(int n) {
        if(n==0){return 0;}
        int[] dp = new int[n+1];
        dp[0]=0;
        dp[1]=1;
        for(int i=2;i<n+1;i++){
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
}