斐波那契数列

public class Solution {    public int Fibonacci(int n) {        int dp[] = new int[39 + 5];        dp[1] = 1;        dp[2] = 1;        for(int i = 3; i <= n; ++i) {            dp[i]= dp[i-1] +dp[i-2];        }        return dp[n];    }}