-
Notifications
You must be signed in to change notification settings - Fork 939
Expand file tree
/
Copy pathmain.cpp
More file actions
59 lines (50 loc) · 1.83 KB
/
main.cpp
File metadata and controls
59 lines (50 loc) · 1.83 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include "../exercise.h"
// READ: Trivial type <https://learn.microsoft.com/zh-cn/cpp/cpp/trivial-standard-layout-and-pod-types?view=msvc-170>
struct FibonacciCache {
unsigned long long cache[16];
int cached; // 最早的尚未被计算器的位置索引
};
/*
// TODO: 实现正确的缓存优化斐波那契计算
static unsigned long long fibonacci(FibonacciCache &cache, int i) {
for (; false; ++cached) {
cache[cached] = cache[cached - 1] + cache[cached - 2];
}
return cache.cache[i];
}
*/
// TODO: 实现正确的缓存优化斐波那契计算
static unsigned long long fibonacci(FibonacciCache &cache, int i) {
// 如果请求的斐波那契数已经在缓存中,直接返回
if (i < cache.cached) {
return cache.cache[i];
}
if (cache.cached < 2) {
cache.cache[0] = 0;
cache.cache[1] = 1;
cache.cached = 2;
}
// 否则,计算并缓存从 cache.cached 到 i 的斐波那契数
for (int j = cache.cached; j <= i; ++j) {
if (j == 0) {
cache.cache[j] = 0;
} else if (j == 1) {
cache.cache[j] = 1;
} else {
cache.cache[j] = cache.cache[j - 1] + cache.cache[j - 2];
}
}
// 更新缓存中已经计算过的斐波那契数的个数
cache.cached = i + 1;
// 返回请求的斐波那契数
return cache.cache[i];
}
int main(int argc, char **argv) {
// TODO: 初始化缓存结构体,使计算正确
// NOTICE: C/C++ 中,读取未初始化的变量(包括结构体变量)是未定义行为
// READ: 初始化的各种写法 <https://zh.cppreference.com/w/cpp/language/initialization>
FibonacciCache fib{};
ASSERT(fibonacci(fib, 10) == 55, "fibonacci(10) should be 55");
std::cout << "fibonacci(10) = " << fibonacci(fib, 10) << std::endl;
return 0;
}