Exercise Submission

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 = 1;
     std::cout << x << " + " << x << " = " << x + x << std::endl;
     return 0;
 }

exercises/02_function/main.cpp

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

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

@@ -3,17 +3,17 @@
 // READ: `static` 关键字 <https://zh.cppreference.com/w/cpp/language/storage_duration>
 // THINK: 这个函数的两个 `static` 各自的作用是什么？
 static int func(int param) {
-    static int static_ = param;
-    // std::cout << "static_ = " << static_ << std::endl;
+    static int static_ = param; // 只会接收第一次赋值
+    std::cout << "static_ = " << static_ << std::endl;
     return static_++;
 }
 
 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

@@ -1,14 +1,30 @@
 #include "../exercise.h"
 
+// constexpr unsigned long long fibonacci(int i) {
+//     switch (i) {
+//         case 0:
+//             return 0;
+//         case 1:
+//             return 1;
+//         default:
+//             return fibonacci(i - 1) + fibonacci(i - 2);
+//     }
+// }
+
 constexpr unsigned long long fibonacci(int i) {
-    switch (i) {
-        case 0:
-            return 0;
-        case 1:
-            return 1;
-        default:
-            return fibonacci(i - 1) + fibonacci(i - 2);
+    if (i == 0) return 0;
+    if (i == 1) return 1;
+
+    unsigned long long a = 0;
+    unsigned long long b = 1;
+    unsigned long long c = 0;
+
+    for (int j = 2; j <= i; j ++) {
+        c = a + b;
+        a = b;
+        b = c;
     }
+    return c;
 }
 
 int main(int argc, char **argv) {
@@ -18,7 +34,8 @@ int main(int argc, char **argv) {
 
     // TODO: 观察错误信息，修改一处，使代码编译运行
     // PS: 编译运行，但是不一定能算出结果……
-    constexpr auto ANS_N = 90;
+    // constexpr auto ANS_N = 90;
+    constexpr auto ANS_N = 90; // 57是可运行上限，但可计算上限实际为56
     constexpr auto ANS = fibonacci(ANS_N);
     std::cout << "fibonacci(" << ANS_N << ") = " << ANS << std::endl;
 

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,9 +5,9 @@
 // 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}, cached;
     // TODO: 设置正确的循环条件
-    for (; false; ++cached) {
+    for (cached = 2; cached <= 96; ++cached) {
         cache[cached] = cache[cached - 1] + cache[cached - 2];
     }
     return cache[i];

exercises/08_pointer/main.cpp

@@ -5,6 +5,11 @@ 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 ++) {
+        if (ptr[i * stride] + ptr[(i + 1) * stride] != ptr[(i + 2) * stride]) {
+            return false;
+        }
+    }
     return true;
 }
 

exercises/09_enum&union/main.cpp

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

exercises/10_trivial/main.cpp

@@ -9,8 +9,8 @@ struct FibonacciCache {
 
 // TODO: 实现正确的缓存优化斐波那契计算
 static unsigned long long fibonacci(FibonacciCache &cache, int i) {
-    for (; false; ++cached) {
-        cache[cached] = cache[cached - 1] + cache[cached - 2];
+    for (; cache.cached <= i; ++cache.cached) {
+        cache.cache[cache.cached] = cache.cache[cache.cached - 1] + cache.cache[cache.cached - 2];
     }
     return cache.cache[i];
 }
@@ -20,6 +20,7 @@ int main(int argc, char **argv) {
     // NOTICE: C/C++ 中，读取未初始化的变量（包括结构体变量）是未定义行为
     // READ: 初始化的各种写法 <https://zh.cppreference.com/w/cpp/language/initialization>
     FibonacciCache fib;
+    fib.cache[0] = 0, fib.cache[1] = 1, fib.cached = 2;
     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

@@ -6,8 +6,8 @@ struct Fibonacci {
 
     // TODO: 实现正确的缓存优化斐波那契计算
     unsigned long long get(int i) {
-        for (; false; ++cached) {
-            cache[cached] = cache[cached - 1] + cache[cached - 2];
+        for (; this->cached <= i; ++this->cached) {
+            this->cache[this->cached] = this->cache[this->cached - 1] + this->cache[this->cached - 2];
         }
         return cache[i];
     }
@@ -16,6 +16,9 @@ struct Fibonacci {
 int main(int argc, char **argv) {
     // TODO: 初始化缓存结构体，使计算正确
     Fibonacci fib;
+    fib.cache[0] = 0;
+    fib.cache[1] = 1;
+    fib.cached = 2;
     ASSERT(fib.get(10) == 55, "fibonacci(10) should be 55");
     std::cout << "fibonacci(10) = " << fib.get(10) << std::endl;
     return 0;

exercises/12_method_const/main.cpp

@@ -5,7 +5,8 @@
 struct Fibonacci {
     int numbers[11];
     // TODO: 修改方法签名和实现，使测试通过
-    int get(int i) {
+    constexpr int get(int i) const {
+        return numbers[i];
     }
 };
 

exercises/13_class/main.cpp

@@ -14,11 +14,17 @@ class Fibonacci {
 
 public:
     // TODO: 实现构造器
-    // Fibonacci()
+    Fibonacci() : cached(0) {
+        if (cached < 16) {
+            cache[cached++] = 0;  
+            cache[cached++] = 1;  
+        }
+    }
 
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
+        if (i < 0 || i >= 16) return 0;
+        for (; cached <= i && cached < 16; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
         return cache[i];

exercises/14_class_destruct/main.cpp

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

exercises/15_class_clone/main.cpp

@@ -3,38 +3,86 @@
 // READ: 复制构造函数 <https://zh.cppreference.com/w/cpp/language/copy_constructor>
 // READ: 函数定义（显式弃置）<https://zh.cppreference.com/w/cpp/language/function>
 
-
 class DynFibonacci {
     size_t *cache;
     int cached;
+    int capacity;
 
 public:
-    // TODO: 实现动态设置容量的构造器
-    DynFibonacci(int capacity): cache(new ?), cached(?) {}
+    // 动态设置容量的构造器
+    DynFibonacci(int cap) : cached(0), capacity(cap) {
+        cache = new size_t[capacity]{}; // 初始化为0
+        if (capacity > 0) cache[cached++] = 0;
+        if (capacity > 1) cache[cached++] = 1;
+    }
+
+    // 复制构造器
+    DynFibonacci(const DynFibonacci& other) : 
+        capacity(other.capacity), 
+        cached(other.cached) {
+        cache = new size_t[capacity];
+        std::copy(other.cache, other.cache + cached, cache);
+    }
+
+    // 移动构造器
+    DynFibonacci(DynFibonacci&& other) noexcept :
+        cache(other.cache),
+        cached(other.cached),
+        capacity(other.capacity) {
+        other.cache = nullptr;
+        other.cached = 0;
+        other.capacity = 0;
+    }
+
+    // 赋值运算符重载
+    DynFibonacci& operator=(const DynFibonacci& other) {
+        if (this != &other) {
+            delete[] cache;
+            capacity = other.capacity;
+            cached = other.cached;
+            cache = new size_t[capacity];
+            std::copy(other.cache, other.cache + cached, cache);
+        }
+        return *this;
+    }
 
-    // TODO: 实现复制构造器
-    DynFibonacci(DynFibonacci const &) = delete;
+    // 移动赋值运算符重载
+    DynFibonacci& operator=(DynFibonacci&& other) noexcept {
+        if (this != &other) {
+            delete[] cache;
+            cache = other.cache;
+            cached = other.cached;
+            capacity = other.capacity;
+            other.cache = nullptr;
+            other.cached = 0;
+            other.capacity = 0;
+        }
+        return *this;
+    }
 
-    // TODO: 实现析构器，释放缓存空间
-    ~DynFibonacci();
+    // 析构器释放内存
+    ~DynFibonacci() {
+        delete[] cache;
+    }
 
-    // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
+        if (i < 0 || i >= capacity) {
+            throw std::out_of_range("Index out of range");
+        }
+
+        for (; cached <= i && cached < capacity; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
+
         return cache[i];
     }
 
-    // NOTICE: 不要修改这个方法
-    // NOTICE: 名字相同参数也相同，但 const 修饰不同的方法是一对重载方法，可以同时存在
-    //         本质上，方法是隐藏了 this 参数的函数
-    //         const 修饰作用在 this 上，因此它们实际上参数不同
+    // const版本：仅读取已缓存的值
     size_t get(int i) const {
-        if (i <= cached) {
-            return cache[i];
+        if (i < 0 || i >= capacity || i >= cached) {
+            return 0;
         }
-        ASSERT(false, "i out of range");
+        return cache[i];
     }
 };