[LeetCode/Java] Fibonacci Number

-Code

class Solution {

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