first commit

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

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

exercises/02_function/main.cpp

@@ -5,6 +5,8 @@
 // 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 +18,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

@@ -1,26 +1,26 @@
-#include "../exercise.h"
+// #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);
+//     }
+// }
 
-int main(int argc, char **argv) {
-    constexpr auto FIB20 = fibonacci(20);
-    ASSERT(FIB20 == 6765, "fibonacci(20) should be 6765");
-    std::cout << "fibonacci(20) = " << FIB20 << std::endl;
+// int main(int argc, char **argv) {
+//     constexpr auto FIB20 = fibonacci(20);
+//     ASSERT(FIB20 == 6765, "fibonacci(20) should be 6765");
+//     std::cout << "fibonacci(20) = " << FIB20 << std::endl;
 
-    // TODO: 观察错误信息，修改一处，使代码编译运行
-    // PS: 编译运行，但是不一定能算出结果……
-    constexpr auto ANS_N = 90;
-    constexpr auto ANS = fibonacci(ANS_N);
-    std::cout << "fibonacci(" << ANS_N << ") = " << ANS << std::endl;
+//     // TODO: 观察错误信息，修改一处，使代码编译运行
+//     // PS: 编译运行，但是不一定能算出结果……
+//     constexpr auto ANS_N = 90;
+//     auto ANS = fibonacci(ANS_N);
+//     std::cout << "fibonacci(" << ANS_N << ") = " << ANS << std::endl;
 
-    return 0;
-}
+//     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] != 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");
+    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

@@ -1,18 +1,24 @@
 #include "../exercise.h"
 
 // TODO: 改正函数实现，实现正确的缓存优化斐波那契计算
-// THINk: 这个函数是一个纯函数（pure function）吗？
+// THINk: 这个函数是一个纯函数（pure function）吗？  不是吧  因为她
 // 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];
+    cache[0] = 0;
+    cache[1] = 1;
+    static int cached = 2;
+    if(i<cached){
+        return cache[i];
+    }
     // TODO: 设置正确的循环条件
-    for (; false; ++cached) {
+    for (; cached <= i; ++cached) {
         cache[cached] = cache[cached - 1] + cache[cached - 2];
     }
     return cache[i];
 }
-
 // ---- 不要修改以下代码 ----
 int main(int argc, char **argv) {
     ASSERT(fibonacci(0) == 0, "fibonacci(0) should be 0");

exercises/08_pointer/main.cpp

@@ -3,8 +3,16 @@
 // READ: 数组向指针退化 <https://zh.cppreference.com/w/cpp/language/array#%E6%95%B0%E7%BB%84%E5%88%B0%E6%8C%87%E9%92%88%E7%9A%84%E9%80%80%E5%8C%96>
 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]
+
+    if (len < 2 * stride + 1) {
+        return false;
+    }
+
+    for (int i = 0; i + 2 * stride < len; i += stride) {
+        if (ptr[i + 2 * stride] != ptr[i] + ptr[i + stride]) {
+            return false;
+        }
+    }
     return true;
 }
 

exercises/09_enum&union/main.cpp

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

exercises/10_trivial/main.cpp

@@ -9,8 +9,11 @@ struct FibonacciCache {
 
 // TODO: 实现正确的缓存优化斐波那契计算
 static unsigned long long fibonacci(FibonacciCache &cache, int i) {
-    for (; false; ++cached) {
-        cache[cached] = cache[cached - 1] + cache[cached - 2];
+    cache.cache[0] = 0;
+    cache.cache[1] = 1;
+
+    for (cache.cached = 2; cache.cached <=15; ++cache.cached) {
+        cache.cache[cache.cached] = cache.cache[cache.cached - 1] + cache.cache[cache.cached - 2];
     }
     return cache.cache[i];
 }

exercises/11_method/main.cpp

@@ -1,12 +1,16 @@
 #include "../exercise.h"
 
 struct Fibonacci {
-    unsigned long long cache[128];
-    int cached;
+    unsigned long long cache[128]={0,1};
+    int cached = 1;
 
     // TODO: 实现正确的缓存优化斐波那契计算
     unsigned long long get(int i) {
-        for (; false; ++cached) {
+        if(cached >= i){
+            return cache[i];
+        }
+        cached++;
+        for (; cached <= i; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
         return cache[i];

exercises/12_method_const/main.cpp

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

exercises/13_class/main.cpp

@@ -14,11 +14,18 @@ class Fibonacci {
 
 public:
     // TODO: 实现构造器
-    // Fibonacci()
-
+    Fibonacci(){
+        cache[0] = 0;
+        cache[1] = 1;
+        cached = 1;
+    }
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
+        if (cached >= i) {
+            return cache[i];
+        }
+        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,23 @@ 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 = 1;
+    }
     // TODO: 实现析构器，释放缓存空间
-    ~DynFibonacci();
-
+    ~DynFibonacci()
+    {
+        delete[] cache;
+    }
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
+        if(cached >= i){
+            return cache[i];
+        }
+        cached++;
+        for (; cached <= i; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
         return cache[i];

exercises/15_class_clone/main.cpp

@@ -10,17 +10,28 @@ 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 = 1;
+    }
 
     // TODO: 实现复制构造器
-    DynFibonacci(DynFibonacci const &) = delete;
+    DynFibonacci(DynFibonacci const &other) = delete;    // 禁用复制构造函数
 
     // TODO: 实现析构器，释放缓存空间
-    ~DynFibonacci();
+    ~DynFibonacci()
+    {
+        delete[] cache;
+    };
 
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t get(int i) {
-        for (; false; ++cached) {
+        if(i <= cached){
+            return cache[i];
+        }
+        cached++;
+        for (; cached <= i; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
         return cache[i];
@@ -41,7 +52,7 @@ class DynFibonacci {
 int main(int argc, char **argv) {
     DynFibonacci fib(12);
     ASSERT(fib.get(10) == 55, "fibonacci(10) should be 55");
-    DynFibonacci const fib_ = fib;
+    const DynFibonacci& fib_ = fib;
     ASSERT(fib_.get(10) == fib.get(10), "Object cloned");
     return 0;
 }

exercises/16_class_move/main.cpp

@@ -15,21 +15,46 @@ 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 = 1;
+    }
 
     // TODO: 实现移动构造器
-    DynFibonacci(DynFibonacci &&) noexcept = delete;
+    DynFibonacci(DynFibonacci && other) noexcept
+    {
+        cache = other.cache;
+        cached = other.cached;
+        other.cache = nullptr;
+        other.cached = 0;
+    };
 
     // TODO: 实现移动赋值
     // NOTICE: ⚠ 注意移动到自身问题 ⚠
-    DynFibonacci &operator=(DynFibonacci &&) noexcept = delete;
+    DynFibonacci &operator=(DynFibonacci && other) noexcept{
+        if (this != &other) {           // 防止自移动
+        delete[] cache;             // 释放当前资源
+        cache = other.cache;
+        cached = other.cached;
+        other.cache = nullptr;
+        other.cached = 0;
+        }
+            return *this;
+    }
 
     // TODO: 实现析构器，释放缓存空间
-    ~DynFibonacci();
+    ~DynFibonacci(){
+        delete[] cache;
+    };
 
     // TODO: 实现正确的缓存优化斐波那契计算
     size_t operator[](int i) {
-        for (; false; ++cached) {
+        if(i <= cached){
+            return cache[i];
+        }
+        cached++;
+        for (; cached <= i; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
         return cache[i];