Homework

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

exercises/02_function/main.cpp

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

exercises/03_argument&parameter/main.cpp

@@ -3,24 +3,31 @@
 // READ: <https://stackoverflow.com/questions/156767/whats-the-difference-between-an-argument-and-a-parameter>
 // THINK: 参数都有哪些传递方式？如何选择传递方式？
 
-void func(int);
+// TODO: 为下列 ASSERT 填写正确的值
+void func(int param) {
+    ASSERT(param == 99, "param should be 99");
+    std::cout << "befor add: " << param << std::endl;
+    param += 1;
+    ASSERT(param == 100, "param should be 100");
+    std::cout << "after add: " << param << std::endl;
+}
 
 // TODO: 为下列 ASSERT 填写正确的值
 int main(int argc, char **argv) {
     auto arg = 99;
-    ASSERT(arg == ?, "arg should be ?");
+    ASSERT(arg == 99, "arg should be 99");
     std::cout << "befor func call: " << arg << std::endl;
     func(arg);
-    ASSERT(arg == ?, "arg should be ?");
+    ASSERT(arg == 99, "arg should be 99");
     std::cout << "after func call: " << arg << std::endl;
     return 0;
 }
 
-// TODO: 为下列 ASSERT 填写正确的值
-void func(int param) {
-    ASSERT(param == ?, "param should be ?");
-    std::cout << "befor add: " << param << std::endl;
-    param += 1;
-    ASSERT(param == ?, "param should be ?");
-    std::cout << "after add: " << param << std::endl;
-}
+// // TODO: 为下列 ASSERT 填写正确的值
+// void func(int param) {
+//     ASSERT(param == ?, "param should be ?");
+//     std::cout << "befor add: " << param << std::endl;
+//     param += 1;
+//     ASSERT(param == ?, "param should be ?");
+//     std::cout << "after add: " << param << std::endl;
+// }

exercises/04_static/main.cpp

@@ -4,16 +4,16 @@
 // THINK: 这个函数的两个 `static` 各自的作用是什么？
 static int func(int param) {
     static int static_ = param;
-    // std::cout << "static_ = " << static_ << std::endl;
+     //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,25 +1,32 @@
 #include "../exercise.h"
 
-constexpr unsigned long long fibonacci(int i) {
+unsigned long long ans[100]={};
+unsigned long long fibonacci(int i) {
     switch (i) {
         case 0:
             return 0;
         case 1:
             return 1;
         default:
-            return fibonacci(i - 1) + fibonacci(i - 2);
+            unsigned long long a,b;
+            if(ans[i-1]) a=ans[i-1];
+            else a=fibonacci(i - 1),ans[i-1]=a;
+            if(ans[i-2]) b=ans[i-2];
+            else b=fibonacci(i - 2),ans[i-2]=b;
+
+            return a+b;
     }
 }
 
 int main(int argc, char **argv) {
-    constexpr auto FIB20 = fibonacci(20);
+    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);
+    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,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 <= i; ++cached) {
         cache[cached] = cache[cached - 1] + cache[cached - 2];
     }
     return cache[i];
@@ -20,7 +20,7 @@ int main(int argc, char **argv) {
     ASSERT(fibonacci(2) == 1, "fibonacci(2) should be 1");
     ASSERT(fibonacci(3) == 2, "fibonacci(3) should be 2");
     ASSERT(fibonacci(10) == 55, "fibonacci(10) should be 55");
-
+    //662
     auto fib90 = fibonacci(90);
     std::cout << "fibonacci(90) = " << fib90 << std::endl;
     ASSERT(fib90 == 2880067194370816120, "fibonacci(90) should be 2880067194370816120");

exercises/08_pointer/main.cpp

@@ -5,6 +5,16 @@ 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]
+    int lst=-1,llst=-1;
+    for(int i = 0;i< stride*len;i+=stride)
+    {
+        int t = ptr[i];
+        if(lst!=-1&&llst!=-1) {
+            if(lst+llst!=t) return false;
+        }
+        llst = lst;
+        lst = t;
+    }
     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

@@ -3,14 +3,14 @@
 // 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];
+    unsigned long long cache[16]={0,1};
     int cached;
 };
 
 // TODO: 实现正确的缓存优化斐波那契计算
 static unsigned long long fibonacci(FibonacciCache &cache, int i) {
-    for (; false; ++cached) {
-        cache[cached] = cache[cached - 1] + cache[cached - 2];
+    for (cache.cached = 2; cache.cached<=i; ++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

@@ -6,7 +6,9 @@ struct Fibonacci {
 
     // TODO: 实现正确的缓存优化斐波那契计算
     unsigned long long get(int i) {
-        for (; false; ++cached) {
+        cache[0] = 0;
+        cache[1] = 1;
+        for (cached = 2; cached <= i; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
         return cache[i];

exercises/12_method_const/main.cpp

@@ -6,11 +6,12 @@ struct Fibonacci {
     int numbers[11];
     // TODO: 修改方法签名和实现，使测试通过
     int get(int i) {
+        return numbers[i];
     }
 };
 
 int main(int argc, char **argv) {
-    Fibonacci constexpr FIB{{0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55}};
+    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

@@ -10,15 +10,20 @@
 // READ: 构造器 <https://zh.cppreference.com/w/cpp/language/constructor>
 class Fibonacci {
     size_t cache[16];
-    int cached;
+    int cached = 0;
 
 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];
@@ -29,6 +34,7 @@ int main(int argc, char **argv) {
     // 现在类型拥有无参构造器，声明时会直接调用。
     // 这个写法不再是未定义行为了。
     Fibonacci fib;
+    //std::cout << fib.get(10)+1 << std::endl;
     ASSERT(fib.get(10) == 55, "fibonacci(10) should be 55");
     std::cout << "fibonacci(10) = " << fib.get(10) << std::endl;
     return 0;

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(2) {
+        cache[0] = 0;
+        cache[1] = 1;
+    }
 
     // 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

@@ -10,17 +10,27 @@ class DynFibonacci {
 
 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 const &) = delete;
+    DynFibonacci(DynFibonacci const &other) : cache(new size_t[other.cached]), cached(other.cached) {
+        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) {
+        for (; cached <= i; ++cached) {
             cache[cached] = cache[cached - 1] + cache[cached - 2];
         }
         return cache[i];

exercises/16_class_move/main.cpp

@@ -15,21 +15,41 @@ class DynFibonacci {
 
 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 &&) noexcept = delete;
+    DynFibonacci(DynFibonacci && other) :cache(nullptr), cached(0) {
+        std::swap(cache, other.cache);
+        std::swap(cached, other.cached);
+    }
 
     // TODO: 实现移动赋值
     // NOTICE: ⚠ 注意移动到自身问题 ⚠
-    DynFibonacci &operator=(DynFibonacci &&) noexcept = delete;
+    DynFibonacci &operator=(DynFibonacci && other) 
+    {
+        if(this != &other)
+        {
+            delete[] cache;
+            cache = nullptr;
+            cached = 0;
+            std::swap(cache, other.cache);
+            std::swap(cached, other.cached);
+        }
+        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