leetcode509

public class Solution
    {

        public int Fib(int N)
        {
            if (N == )
            {
                return ;
            }
            else if (N == )
            {
                return ;
            }
            else
            {
                List<int> list = new List<int>();
                list.Add();
                list.Add();
                for (int i = ; i <= N; i++)
                {
                    list.Add(list[i - ] + list[i - ]);
                }
                return list[N];
            }
        }
    }

补充一个python的实现：

 class Solution:
     def fib(self, N: int) -> int:
         if N==:
             return
         if N==:
             return
         dp = [] * (N+)
         dp[] =
         dp[] =
         for i in range(,N+):
             dp[i] = dp[i-] + dp[i-]
         return dp[N]