通过测试

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,7 @@
 // NOTICE: 补充由内而外读法的机翻解释 <https://learn.microsoft.com/zh-cn/cpp/c-language/interpreting-more-complex-declarators?view=msvc-170>
 
 // TODO: 在这里声明函数
+int add(int a, int b);
 
 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

@@ -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,9 +18,11 @@ int main(int argc, char **argv) {
 
     // TODO: 观察错误信息，修改一处，使代码编译运行
     // PS: 编译运行，但是不一定能算出结果……
-    constexpr auto ANS_N = 90;
+    constexpr auto ANS_N = 10;
     constexpr auto ANS = fibonacci(ANS_N);
     std::cout << "fibonacci(" << ANS_N << ") = " << ANS << std::endl;
 
     return 0;
 }
+
+//constexpr 会让常量的数据在编译时就计算出来数据

exercises/06_array/main.cpp

@@ -11,13 +11,15 @@ unsigned long long fibonacci(int i) {
             return 1;
         default:
             // TODO: 补全三目表达式缺失的部分
-            return <condition> ? <cache> : (arr[i] = fibonacci(i - 1) + fibonacci(i - 2));
+            return arr[i] != 0 ? 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");
+    //std::cout << sizeof(arr) << std::endl;
+    //90个unsigned long long类型的元素，每个元素8字节，共720字节
+    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,12 @@
 // 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 = 2;
     // TODO: 设置正确的循环条件
-    for (; false; ++cached) {
+    if (i < cached) {
+        return cache[i];
+    }
+    for (; i>= cached; ++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 + 2) * stride) != *(ptr + i * stride) + *(ptr + (i + 1) * stride)) {
+            return false;
+        }
+    }
     return true;
 }
 

exercises/09_enum&union/main.cpp

@@ -35,8 +35,28 @@ ColorEnum convert_by_pun(Color c) {
         Color c;
     };
 
-    TypePun pun;
+    static TypePun pun;
+    //不使用静态编译会有警告因为尝试返回局部变量的引用
     // TODO: 补全类型双关转换
+    switch (c) {
+        case Color::Red:
+            pun.c = Color::Red;
+            pun.e = COLOR_RED;
+            break;
+        case Color::Green:
+            pun.c = Color::Green;
+            pun.e = COLOR_GREEN;
+            break;
+        case Color::Yellow:
+            pun.c = Color::Yellow;
+            pun.e = COLOR_YELLOW;
+            break;
+        case Color::Blue:
+            pun.c = Color::Blue;
+            pun.e = COLOR_BLUE;
+            break;
+    }
+
 
     return pun.e;
 }

exercises/10_trivial/main.cpp

@@ -9,8 +9,12 @@ struct FibonacciCache {
 
 // TODO: 实现正确的缓存优化斐波那契计算
 static unsigned long long fibonacci(FibonacciCache &cache, int i) {
-    for (; false; ++cached) {
-        cache[cached] = cache[cached - 1] + cache[cached - 2];
+    int cached = cache.cached;
+    if (i < cached) {
+        return cache.cache[i];
+    }
+    for (; cached <= i; ++cached) {
+        cache.cache[cached] = cache.cache[cached - 1] + cache.cache[cached - 2];
     }
     return cache.cache[i];
 }
@@ -20,6 +24,9 @@ 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,16 +6,20 @@ struct Fibonacci {
 
     // TODO: 实现正确的缓存优化斐波那契计算
     unsigned long long get(int i) {
-        for (; false; ++cached) {
+        for (; cached <= i; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
         return cache[i];
     }
 };
+//结构里的变量是可以直接访问的
 
 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,13 +5,33 @@
 struct Fibonacci {
     int numbers[11];
     // TODO: 修改方法签名和实现，使测试通过
-    int get(int i) {
+    int get(int i) const {
+        return numbers[i];
     }
+    //一定要加const修饰符 非 const 成员函数不能被 const 对象调用。
 };
 
 int main(int argc, char **argv) {
     Fibonacci constexpr 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;
 }
+
+/*
+struct Point {
+    int x;
+    int y;
+};
+
+int main() {
+    constexpr Point p{3, 4};          // ✅ 聚合初始化
+    // 或者更明确一点：
+    constexpr Point q = {10, 20};     // ✅ 等价写法
+
+    std::cout << p.x << ", " << p.y << std::endl; // 输出: 3, 4
+}
+看起来也是跟python类似的结构体初始化
+
+*/

exercises/13_class/main.cpp

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

exercises/14_class_destruct/main.cpp

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

exercises/15_class_clone/main.cpp

@@ -7,20 +7,35 @@
 class DynFibonacci {
     size_t *cache;
     int cached;
+    int capacity;
 
 public:
     // TODO: 实现动态设置容量的构造器
-    DynFibonacci(int capacity): cache(new ?), cached(?) {}
+    DynFibonacci(int capacity): cache(new size_t [capacity]), cached(0), capacity(capacity) {
+        cache[0] = 0;
+        cache[1] = 1;
+        cached = 2;
+    }
 
     // TODO: 实现复制构造器
-    DynFibonacci(DynFibonacci const &) = delete;
+    DynFibonacci(const DynFibonacci& other)
+        : capacity(other.capacity)
+        , cached(other.cached)
+        , cache(new size_t[other.capacity])
+    {
+        // 深拷贝缓存内容
+        for (int i = 0; i < other.cached; ++i) {
+            cache[i] = other.cache[i];
+        }
+    }
 
-    // TODO: 实现析构器，释放缓存空间
-    ~DynFibonacci();
+    ~DynFibonacci() {
+        delete[] cache;
+    }
 
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
+        for (; cached <= i; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
         return cache[i];

exercises/16_class_move/main.cpp

@@ -12,24 +12,45 @@
 class DynFibonacci {
     size_t *cache;
     int cached;
+    int capacity;
 
 public:
     // TODO: 实现动态设置容量的构造器
-    DynFibonacci(int capacity): cache(new ?), cached(?) {}
-
+        DynFibonacci(int capacity): cache(new size_t [capacity]), cached(0), capacity(capacity) {
+        cache[0] = 0;
+        cache[1] = 1;
+        cached = 2;
+    }
     // TODO: 实现移动构造器
-    DynFibonacci(DynFibonacci &&) noexcept = delete;
+    DynFibonacci(DynFibonacci &&other) noexcept : cache(other.cache), cached(other.cached), capacity(other.capacity) {
+        other.cache = nullptr;
+        other.cached = 0;
+        other.capacity = 0;
+    }
 
     // TODO: 实现移动赋值
     // NOTICE: ⚠ 注意移动到自身问题 ⚠
-    DynFibonacci &operator=(DynFibonacci &&) noexcept = 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 operator[](int i) {
-        for (; false; ++cached) {
+        for (; cached <= i; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
         return cache[i];

exercises/17_class_derive/main.cpp

@@ -50,9 +50,9 @@ int main(int argc, char **argv) {
     B b = B(3);
 
     // TODO: 补全三个类型的大小
-    static_assert(sizeof(X) == ?, "There is an int in X");
-    static_assert(sizeof(A) == ?, "There is an int in A");
-    static_assert(sizeof(B) == ?, "B is an A with an X");
+    static_assert(sizeof(X) == 4, "There is an int in X");
+    static_assert(sizeof(A) == 4, "There is an int in A");
+    static_assert(sizeof(B) == 8, "B is an A with an X");
 
     i = 0;
     std::cout << std::endl
@@ -67,7 +67,8 @@ int main(int argc, char **argv) {
     // THINK: 观察打印出的信息，推测把大象放进冰箱分几步？
     // THINK: 这样的代码是“安全”的吗？
     // NOTICE: 真实场景中不太可能出现这样的代码
-
+//可以简单理解成先创建了一个临时变量 B(5)，然后把这个临时变量的 A 部分拷贝到 ab 中
+//之后这个B(5)的临时变量就被销毁了
     i = 0;
     std::cout << std::endl
               << "-------------------------" << std::endl