摘要: 1 long long int Fibonacci(int n) 2 { 3 int i; 4 long long int *dp, ret; 5 dp = malloc(sizeof(long long int ) * (n+1)); 6 7 dp[0]=0; dp[1] = 1; 8 for ( 阅读全文
posted @ 2020-05-29 11:23 yushimeng 阅读(418) 评论(0) 推荐(0) 编辑