作业提交

exercises/00_hello_world/main.cpp

@@ -6,6 +6,6 @@
 
 int main(int argc, char **argv) {
     // TODO: 在控制台输出 "Hello, InfiniTensor!" 并换行
-    std::cout : "Hello, InfiniTensor!" + std::endl;
+    std::cout << "Hello, InfiniTensor!" << std::endl;
     return 0;
 }

exercises/01_variable&add/main.cpp

@@ -5,6 +5,7 @@
 int main(int argc, char **argv) {
     // TODO: 补全变量定义并打印加法运算
     // x ?
+    int x = 42;
     std::cout << x << " + " << x << " = " << x + x << std::endl;
     return 0;
 }

exercises/02_function/main.cpp

@@ -5,6 +5,10 @@
 // NOTICE: 补充由内而外读法的机翻解释 <https://learn.microsoft.com/zh-cn/cpp/c-language/interpreting-more-complex-declarators?view=msvc-170>
 
 // TODO: 在这里声明函数
+int add(int a, int b) {
+    // TODO: 补全函数定义，但不要移动代码行
+    return a + b;
+}
 
 int main(int argc, char **argv) {
     ASSERT(add(123, 456) == 123 + 456, "add(123, 456) should be 123 + 456");
@@ -14,6 +18,3 @@ int main(int argc, char **argv) {
     return 0;
 }
 
-int add(int a, int b) {
-    // TODO: 补全函数定义，但不要移动代码行
-}

exercises/03_argument&parameter/main.cpp

@@ -8,19 +8,19 @@ void func(int);
 // TODO: 为下列 ASSERT 填写正确的值
 int main(int argc, char **argv) {
     auto arg = 99;
-    ASSERT(arg == ?, "arg should be ?");
+    ASSERT(arg == 99, "arg should be ?");
     std::cout << "befor func call: " << arg << std::endl;
     func(arg);
-    ASSERT(arg == ?, "arg should be ?");
+    ASSERT(arg == 99, "arg should be ?");
     std::cout << "after func call: " << arg << std::endl;
     return 0;
 }
 
 // TODO: 为下列 ASSERT 填写正确的值
 void func(int param) {
-    ASSERT(param == ?, "param should be ?");
+    ASSERT(param == 99, "param should be ?");
     std::cout << "befor add: " << param << std::endl;
     param += 1;
-    ASSERT(param == ?, "param should be ?");
+    ASSERT(param == 100, "param should be ?");
     std::cout << "after add: " << param << std::endl;
 }

exercises/04_static/main.cpp

@@ -10,10 +10,10 @@ static int func(int param) {
 
 int main(int argc, char **argv) {
     // TODO: 将下列 `?` 替换为正确的数字
-    ASSERT(func(5) == ?, "static variable value incorrect");
-    ASSERT(func(4) == ?, "static variable value incorrect");
-    ASSERT(func(3) == ?, "static variable value incorrect");
-    ASSERT(func(2) == ?, "static variable value incorrect");
-    ASSERT(func(1) == ?, "static variable value incorrect");
+    ASSERT(func(5) == 5, "static variable value incorrect");
+    ASSERT(func(4) == 6, "static variable value incorrect");
+    ASSERT(func(3) == 7, "static variable value incorrect");
+    ASSERT(func(2) == 8, "static variable value incorrect");
+    ASSERT(func(1) == 9, "static variable value incorrect");
     return 0;
 }

exercises/05_constexpr/main.cpp

@@ -18,8 +18,8 @@ int main(int argc, char **argv) {
 
     // TODO: 观察错误信息，修改一处，使代码编译运行
     // PS: 编译运行，但是不一定能算出结果……
-    constexpr auto ANS_N = 90;
-    constexpr auto ANS = fibonacci(ANS_N);
+    constexpr auto ANS_N = 30;
+    auto ANS = fibonacci(ANS_N);
     std::cout << "fibonacci(" << ANS_N << ") = " << ANS << std::endl;
 
     return 0;

exercises/06_array/main.cpp

@@ -11,13 +11,13 @@ unsigned long long fibonacci(int i) {
             return 1;
         default:
             // TODO: 补全三目表达式缺失的部分
-            return <condition> ? <cache> : (arr[i] = fibonacci(i - 1) + fibonacci(i - 2));
+            return arr[i] ? arr[i] : (arr[i] = fibonacci(i - 1) + fibonacci(i - 2));
     }
 }
 
 int main(int argc, char **argv) {
     // TODO: 为此 ASSERT 填写正确的值
-    ASSERT(sizeof(arr) == ?, "sizeof array is size of all its elements");
+    ASSERT(sizeof(arr) == 720, "sizeof array is size of all its elements");
     // ---- 不要修改以下代码 ----
     ASSERT(fibonacci(2) == 1, "fibonacci(2) should be 1");
     ASSERT(fibonacci(20) == 6765, "fibonacci(20) should be 6765");

exercises/07_loop/main.cpp

@@ -5,10 +5,11 @@
 // READ: 纯函数 <https://zh.wikipedia.org/wiki/%E7%BA%AF%E5%87%BD%E6%95%B0>
 static unsigned long long fibonacci(int i) {
     // TODO: 为缓存设置正确的初始值
-    static unsigned long long cache[96], cached;
+    static unsigned long long cache[96] = {0, 1};
+    static int cached = 1;
     // TODO: 设置正确的循环条件
-    for (; false; ++cached) {
-        cache[cached] = cache[cached - 1] + cache[cached - 2];
+    for (; cached < i; ++cached) {
+        cache[cached+1] = cache[cached - 1] + cache[cached];
     }
     return cache[i];
 }

exercises/08_pointer/main.cpp

@@ -5,6 +5,18 @@ bool is_fibonacci(int *ptr, int len, int stride) {
     ASSERT(len >= 3, "`len` should be at least 3");
     // TODO: 编写代码判断从 ptr 开始，每 stride 个元素取 1 个元素，组成长度为 n 的数列是否满足
     // arr[i + 2] = arr[i] + arr[i + 1]
+       // 遍历数组，检查是否满足斐波那契数列规律
+    for (int i = 0; i < len - 2; i++) {
+        int current = *(ptr + i * stride);
+        int next = *(ptr + (i + 1) * stride);
+        int next_next = *(ptr + (i + 2) * stride);
+
+        // 检查是否满足斐波那契规律：arr[i+2] = arr[i] + arr[i+1]
+        if (next_next != current + next) {
+            return false;
+        }
+    }
+
     return true;
 }
 

exercises/09_enum&union/main.cpp

@@ -37,7 +37,7 @@ ColorEnum convert_by_pun(Color c) {
 
     TypePun pun;
     // TODO: 补全类型双关转换
-
+    pun.c = c;
     return pun.e;
 }
 

exercises/10_trivial/main.cpp

@@ -9,17 +9,23 @@ struct FibonacciCache {
 
 // TODO: 实现正确的缓存优化斐波那契计算
 static unsigned long long fibonacci(FibonacciCache &cache, int i) {
-    for (; false; ++cached) {
-        cache[cached] = cache[cached - 1] + cache[cached - 2];
+    for (int n = cache.cached; n <= i; ++n) {
+        if (n <= 1) {
+            cache.cache[n] = n;
+        } else {
+            cache.cache[n] = cache.cache[n - 1] + cache.cache[n - 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;
+    FibonacciCache fib = {{0, 1}, 1};
     ASSERT(fibonacci(fib, 10) == 55, "fibonacci(10) should be 55");
     std::cout << "fibonacci(10) = " << fibonacci(fib, 10) << std::endl;
     return 0;

exercises/11_method/main.cpp

@@ -4,11 +4,26 @@ struct Fibonacci {
     unsigned long long cache[128];
     int cached;
 
+    Fibonacci() : cached(0) {
+        cache[0] = 0;  // F(0) = 0
+        cache[1] = 1;  // F(1) = 1
+        cached = 2;    // 已经缓存了前两个值
+    }
+
     // TODO: 实现正确的缓存优化斐波那契计算
     unsigned long long get(int i) {
-        for (; false; ++cached) {
-            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        if (i < cached) {
+            return cache[i];
+        }
+
+        // 计算并缓存从cached到i的所有值
+        for (int n = cached; n <= i; ++n) {
+            cache[n] = cache[n - 1] + cache[n - 2];
         }
+
+        // 更新缓存的位置（i+1，因为数组从0开始）
+        cached = i + 1;
+
         return cache[i];
     }
 };

exercises/12_method_const/main.cpp

@@ -5,12 +5,13 @@
 struct Fibonacci {
     int numbers[11];
     // TODO: 修改方法签名和实现，使测试通过
-    int get(int i) {
+    constexpr int get(int i) const {
+        return numbers[i];
     }
 };
 
 int main(int argc, char **argv) {
-    Fibonacci constexpr FIB{{0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55}};
+    constexpr Fibonacci FIB{{0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55}};
     ASSERT(FIB.get(10) == 55, "fibonacci(10) should be 55");
     std::cout << "fibonacci(10) = " << FIB.get(10) << std::endl;
     return 0;

exercises/13_class/main.cpp

@@ -14,12 +14,24 @@ class Fibonacci {
 
 public:
     // TODO: 实现构造器
-    // Fibonacci()
+    Fibonacci() {
+        cache[0] = 0;
+        cache[1] = 1;
+        cached = 2;  // 已经缓存了0和1两个值
+
+        // 预先计算并缓存到最大可能的索引（15）
+        for (; cached < 16; ++cached) {
+            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        }
+    }
+
 
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
+        // 如果请求的索引超出已缓存范围，继续计算并缓存
+        while (i >= cached && cached < 16) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
+            ++cached;
         }
         return cache[i];
     }

exercises/14_class_destruct/main.cpp

@@ -10,17 +10,26 @@ class DynFibonacci {
     int cached;
 
 public:
-    // TODO: 实现动态设置容量的构造器
-    DynFibonacci(int capacity): cache(new ?), cached(?) {}
+    // 实现动态设置容量的构造器
+    DynFibonacci(int capacity): cache(new size_t[capacity]), cached(2) {
+        // 初始化前两个斐波那契数
+        cache[0] = 0;
+        cache[1] = 1;
+    }
 
-    // TODO: 实现析构器，释放缓存空间
-    ~DynFibonacci();
+    // 实现析构器，释放缓存空间
+    ~DynFibonacci() {
+        delete[] cache;
+    }
 
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
-            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        if (i >= cached) {
+            for (; cached <= i; ++cached) {
+                cache[cached] = cache[cached - 1] + cache[cached - 2];
+            }
         }
+
         return cache[i];
     }
 };

exercises/15_class_clone/main.cpp

@@ -6,23 +6,43 @@
 
 class DynFibonacci {
     size_t *cache;
-    int cached;
+    int capacity;
+    int cached; 
 
 public:
     // TODO: 实现动态设置容量的构造器
-    DynFibonacci(int capacity): cache(new ?), cached(?) {}
+    DynFibonacci(int capacity): cache(new size_t[capacity]), cached(1) {
+         cache = new size_t[capacity + 1];
+        cache[0] = 0;  // F(0) = 0
+        cache[1] = 1;  // F(1) = 1
+    }
 
     // TODO: 实现复制构造器
-    DynFibonacci(DynFibonacci const &) = delete;
+    DynFibonacci(const DynFibonacci &other): 
+        capacity(other.capacity), cached(other.cached) {
+        cache = new size_t[capacity + 1];
+        for (int i = 0; i <= cached; ++i) {
+            cache[i] = other.cache[i];
+        }
+    }
 
     // TODO: 实现析构器，释放缓存空间
-    ~DynFibonacci();
+    ~DynFibonacci() {
+        delete[] cache;
+    }
+
 
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
-            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        if (i <= cached) {
+            return cache[i];
+        }
+
+        // 扩展缓存直到包含第 i 个斐波那契数
+        for (int j = cached + 1; j <= i; ++j) {
+            cache[j] = cache[j - 1] + cache[j - 2];
         }
+        cached = i;  // 更新已缓存的索引
         return cache[i];
     }