From 3f1183d4ffa9a51f05f8a0b66d5029c7b051c0d6 Mon Sep 17 00:00:00 2001
From: LRache <2746324475@qq.com>
Date: Fri, 8 Nov 2024 18:48:37 +0800
Subject: [PATCH] =?UTF-8?q?feat:=E5=A2=9E=E5=8A=A0=E4=BA=86=E5=AF=B9makefi?=
 =?UTF-8?q?le=20valgrind=20gdb=E8=AF=B4=E6=98=8E=E7=9A=84=E9=93=BE?=
 =?UTF-8?q?=E6=8E=A5?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../Lab6-Sol/pwd_checker/include/checker.h    |   8 -
 .../Lab6-Sol/pwd_checker/src/checker.c        |  95 ----------
 .../Lab6-Sol/pwd_checker/test/test.c          |  52 ------
 Labs/Solutions/Lab6-Sol/solution.md           | 163 ------------------
 Labs/Solutions/Lab6-Sol/task1.c               |  23 ---
 Labs/Solutions/Lab6-Sol/task12.c              |  31 ----
 Labs/Solutions/Lab6-Sol/task13.c              |  80 ---------
 .../Lab6-Sol/zuma/include/linkedlist.h        |   4 -
 Labs/Solutions/Lab6-Sol/zuma/include/zuma.h   |  25 ---
 Labs/Solutions/Lab6-Sol/zuma/makefile         |  22 ---
 Labs/Solutions/Lab6-Sol/zuma/src/linkedlist.c |  26 ---
 Labs/Solutions/Lab6-Sol/zuma/src/main.c       |  12 --
 Labs/Solutions/Lab6-Sol/zuma/src/zuma.c       | 147 ----------------
 Labs/Solutions/Lab6-Sol/zuma/task67.mk        |  35 ----
 Labs/lab6/Lab6.tar.gz                         | Bin 0 -> 7139 bytes
 Labs/lab6/README.md                           |   7 +
 Labs/lab6/pwd_checker/include/checker.h       |   8 -
 Labs/lab6/pwd_checker/src/checker.c           |  95 ----------
 Labs/lab6/pwd_checker/test/test.c             |  52 ------
 Labs/lab6/task1.c                             |  23 ---
 Labs/lab6/task12.c                            |  35 ----
 Labs/lab6/task13.c                            |  76 --------
 Labs/lab6/zuma/include/linkedlist.h           |   4 -
 Labs/lab6/zuma/include/zuma.h                 |  20 ---
 Labs/lab6/zuma/src/linkedlist.c               |  26 ---
 Labs/lab6/zuma/src/main.c                     |  12 --
 Labs/lab6/zuma/src/zuma.c                     | 147 ----------------
 27 files changed, 7 insertions(+), 1221 deletions(-)
 delete mode 100644 Labs/Solutions/Lab6-Sol/pwd_checker/include/checker.h
 delete mode 100644 Labs/Solutions/Lab6-Sol/pwd_checker/src/checker.c
 delete mode 100644 Labs/Solutions/Lab6-Sol/pwd_checker/test/test.c
 delete mode 100644 Labs/Solutions/Lab6-Sol/solution.md
 delete mode 100644 Labs/Solutions/Lab6-Sol/task1.c
 delete mode 100644 Labs/Solutions/Lab6-Sol/task12.c
 delete mode 100644 Labs/Solutions/Lab6-Sol/task13.c
 delete mode 100644 Labs/Solutions/Lab6-Sol/zuma/include/linkedlist.h
 delete mode 100644 Labs/Solutions/Lab6-Sol/zuma/include/zuma.h
 delete mode 100644 Labs/Solutions/Lab6-Sol/zuma/makefile
 delete mode 100644 Labs/Solutions/Lab6-Sol/zuma/src/linkedlist.c
 delete mode 100644 Labs/Solutions/Lab6-Sol/zuma/src/main.c
 delete mode 100644 Labs/Solutions/Lab6-Sol/zuma/src/zuma.c
 delete mode 100644 Labs/Solutions/Lab6-Sol/zuma/task67.mk
 create mode 100644 Labs/lab6/Lab6.tar.gz
 delete mode 100644 Labs/lab6/pwd_checker/include/checker.h
 delete mode 100644 Labs/lab6/pwd_checker/src/checker.c
 delete mode 100644 Labs/lab6/pwd_checker/test/test.c
 delete mode 100644 Labs/lab6/task1.c
 delete mode 100644 Labs/lab6/task12.c
 delete mode 100644 Labs/lab6/task13.c
 delete mode 100644 Labs/lab6/zuma/include/linkedlist.h
 delete mode 100644 Labs/lab6/zuma/include/zuma.h
 delete mode 100644 Labs/lab6/zuma/src/linkedlist.c
 delete mode 100644 Labs/lab6/zuma/src/main.c
 delete mode 100644 Labs/lab6/zuma/src/zuma.c

diff --git a/Labs/Solutions/Lab6-Sol/pwd_checker/include/checker.h b/Labs/Solutions/Lab6-Sol/pwd_checker/include/checker.h
deleted file mode 100644
index 6485ca9..0000000
--- a/Labs/Solutions/Lab6-Sol/pwd_checker/include/checker.h
+++ /dev/null
@@ -1,8 +0,0 @@
-#ifndef PWD_CHECKER_H
-#define PWD_CHECKER_H
-
-#include <stdbool.h>
-
-bool check_password(const char *first_name, const char *last_name, const char *password);
-
-#endif // PWD_CHECKER_H
diff --git a/Labs/Solutions/Lab6-Sol/pwd_checker/src/checker.c b/Labs/Solutions/Lab6-Sol/pwd_checker/src/checker.c
deleted file mode 100644
index f1a1aa2..0000000
--- a/Labs/Solutions/Lab6-Sol/pwd_checker/src/checker.c
+++ /dev/null
@@ -1,95 +0,0 @@
-#include "checker.h"
-#include <assert.h>
-#include <string.h>
-
-/*
-Password checker
-
-Requirements:
-- Password must be at least 10 characters
-- Password must contain at least
-    - 1 upper case letter
-    - 1 lower case letter
-    - 1 number
-- Password cannot contain the person's first name or last name (case sensitive)
-
-For the simplicity of this exercise:
-- This is not the most efficient way to implement this program
-- These functions do not perform any error checking
-- You can assume that the first and last name will never be the empty string
-*/
-
-/* Returns true if the length of PASSWORD is at least 10, false otherwise */
-bool check_length(const char *password) {
-  int length = strlen(password);
-  bool meets_len_req = (length >= 10);
-  return meets_len_req;
-}
-
-/* Returns true if LETTER is in the range [LOWER, UPPER], false otherwise */
-bool check_range(char letter, char lower, char upper) {
-  bool is_in_range = (letter >= lower && letter <= upper);
-  return is_in_range;
-}
-
-/* Returns true if PASSWORD contains at least one upper case letter, false
- * otherwise */
-bool check_upper(const char *password) {
-  while (*password != '\0') {
-    bool is_in_range = check_range(*password, 'A', 'Z');
-    if (is_in_range) {
-      return true;
-    }
-    ++password;
-  }
-  return false;
-}
-
-/* Returns true if PASSWORD contains at least one lower case letter, false
- * otherwise */
-bool check_lower(const char *password) {
-  while (*password != '\0') {
-    bool is_in_range = check_range(*password, 'a', 'z');
-    if (is_in_range) {
-      return true;
-    }
-    ++password;
-  }
-  return false;
-}
-
-/* Returns true if PASSWORD contains at least one number, false otherwise */
-bool check_number(const char *password) {
-  while (*password != '\0') {
-    if (check_range(*password, '0', '9')) {
-      return true;
-    }
-    ++password;
-  }
-  return false;
-}
-
-/* Returns true if the person's first and last name are NOT in the password,
- * false otherwise */
-bool check_name(const char *first_name, const char *last_name,
-                const char *password) {
-  /* Type "man strstr" in your terminal to learn what strstr does!
-      To exit the man pages, press 'q' */
-  /* Hint: a NULL pointer will evaluate to False in a logical statement while a
-     non-NULL pointer will evaluate to True */
-  const char *first = strstr(password, first_name);
-  const char *last = strstr(password, last_name);
-  return (!first && !last);
-}
-
-/* Returns true if PASSWORD meets the conditions specified above */
-bool check_password(const char *first_name, const char *last_name,
-                    const char *password) {
-  bool length, upper, lower, number, name;
-  lower = check_lower(password);
-  length = check_length(password);
-  name = check_name(first_name, last_name, password);
-  number = check_number(password);
-  upper = check_upper(password);
-  return (lower && length && name && upper && number);
-}
diff --git a/Labs/Solutions/Lab6-Sol/pwd_checker/test/test.c b/Labs/Solutions/Lab6-Sol/pwd_checker/test/test.c
deleted file mode 100644
index 7d1e5dd..0000000
--- a/Labs/Solutions/Lab6-Sol/pwd_checker/test/test.c
+++ /dev/null
@@ -1,52 +0,0 @@
-#include "checker.h"
-#include <assert.h>
-#include <stdio.h>
-
-int main() {
-  printf("Running tests...\n\n");
-
-  const char *test1_first = "Abraham";
-  const char *test1_last = "Garcia";
-  const char *test1_pwd = "qrtv?,mp!ltrA0b13rab4ham";
-  bool test1 = check_password(test1_first, test1_last, test1_pwd);
-  assert(test1);
-
-  const char *test2_first = "Anjali";
-  const char *test2_last = "Patel";
-  const char *test2_pwd = "Aj8r";
-  bool test2 = check_password(test2_first, test2_last, test2_pwd);
-  assert(!test2);
-
-  const char *test3_first = "Chantelle";
-  const char *test3_last = "Brown";
-  const char *test3_pwd = "QLRIOW815N";
-  bool test3 = check_password(test3_first, test3_last, test3_pwd);
-  assert(!test3);
-
-  const char *test4_first = "Wei";
-  const char *test4_last = "Zhang";
-  const char *test4_pwd = "pjkdihn!o901";
-  bool test4 = check_password(test4_first, test4_last, test4_pwd);
-  assert(!test4);
-
-  const char *test5_first = "John";
-  const char *test5_last = "Smith";
-  const char *test5_pwd = "ALKLIenhLq";
-  bool test5 = check_password(test5_first, test5_last, test5_pwd);
-  assert(!test5);
-
-  const char *test6_first = "Haeun";
-  const char *test6_last = "Kim";
-  const char *test6_pwd = "Ji9anjwHaeun";
-  bool test6 = check_password(test6_first, test6_last, test6_pwd);
-  assert(!test6);
-
-  const char *test7_first = "Adeline";
-  const char *test7_last = "DuBois";
-  const char *test7_pwd = "ALKLIDuBoisen3hLq";
-  bool test7 = check_password(test7_first, test7_last, test7_pwd);
-  assert(!test7);
-
-  printf("Congrats! You have passed all of the test cases!\n");
-  return 0;
-}
diff --git a/Labs/Solutions/Lab6-Sol/solution.md b/Labs/Solutions/Lab6-Sol/solution.md
deleted file mode 100644
index e6d7dc8..0000000
--- a/Labs/Solutions/Lab6-Sol/solution.md
+++ /dev/null
@@ -1,163 +0,0 @@
-# Lab6 使用工具
-
-## GCC、多文件编译和Makefile
-
-### Task1
-
-1. 使用命令`gcc ./task1.c -o ./task1 -Wall -Werror`编译，会看到两个错误。
-2. 错误分别是将`char`赋值给`char*`和返回的`Cource **`与函数声明中的`Course *`不符。
-3. 修改：
-
-```patch
---- ./task1.c
-+++ ./task1_solution.c
-@@ -10,9 +10,9 @@
- struct Course *make_course(int id, char *name) {
-     struct Course *new_course = malloc(sizeof(struct Course));
-     new_course->id = id;
--    new_course->name = *name;
-+    new_course->name = name;
-
--    return &new_course;
-+    return new_course;
- }
- int main() {
-     struct Course *cstart = make_course(0x001, "cstart");
-```
-
-### Task2
-
-1. 在目录`./zuma`下使用命令`gcc -I./include ./src/linkedlist.c ./src/main.c ./src/zuma.c -o zuma`进行编译。
-2. 错误是由引入了两次`zuma.h`头文件（在`zuma.c`的第一行，第一次引入，在第二行包含`linkedlist.h`的时候再次引入）造成的，多个变量被重复声明。
-3. 解决办法：
-    方法一：
-
-    ```patch
-    --- ./zuma/include/zuma.h
-    +++ ./zuma/include/zuma_solution.h
-    @@ -1,3 +1,5 @@
-    +#pragma once
-    +
-    #include <stdio.h>
-    #include <stdlib.h>
-    ```
-
-    方法二：
-
-    ```patch
-    --- ./zuma/include/zuma.h
-    +++ ./zuma/include/zuma_solution.h
-    @@ -1,3 +1,6 @@
-    +#ifndef __ZUMA_H__
-    +#define __ZUMA_H__
-    +
-    #include <stdio.h>
-    #include <stdlib.h>
-
-    @@ -17,4 +20,6 @@
-    void set_top(int k);
-    void init();
-    void solve();
-    -void print_all();
-    \ No newline at end of file
-    +void print_all();
-    +
-    +#endif
-    ```
-
-### Task3 Task4 Task5
-
-见`./zuma/makefile`。
-
-### Task6 Task7
-
-见`./zuma/task67.mk`。这是一个复杂的脚本。基本思想是：
-
-1. 为每个`.c`源文件生成一个`.o`的目标文件。
-2. 每个目标文件`.o`的依赖由`gcc -MMD`生成。
-
-一些细节：
-
-1. 通过规则`$(BUILD_DIR)/%.o: ./src/%.c`为每一个`.c`文件生成一个`.o`文件，并且附带一个`.d`的依赖文件来表明依赖。
-2. `-include $(DEPS)`用于引入`gcc`生成的依赖，你可以查看`build`目录下的`.d`文件来理解。
-
-### Task8
-
-使用`bear -- make`。
-
-## 调试工具
-
-### Task9
-
-现在你学会了`assert`，尝试在你自己项目中进行防御性编程吧。
-
-### Task10 Task11
-
-错误有三个地方：
-
-```patch
---- ./src/checker.c
-+++ ./src/checker_solution.c
-@@ -22,13 +22,13 @@
- /* Returns true if the length of PASSWORD is at least 10, false otherwise */
- bool check_length(const char *password) {
-     int length = strlen(password);
--    bool meets_len_req = (length <= 10);
-+    bool meets_len_req = (length >= 10);
-     return meets_len_req;
- }
-
- /* Returns true if LETTER is in the range [LOWER, UPPER], false otherwise */
- bool check_range(char letter, char lower, char upper) {
--    bool is_in_range = (letter > lower && letter < upper);
-+    bool is_in_range = (letter >= lower && letter <= upper);
-     return is_in_range;
- }
-
-@@ -59,7 +59,7 @@
- /* Returns true if PASSWORD contains at least one number, false otherwise */
- bool check_number(const char *password) {
-     while (*password != '\0') {
--        if (check_range(*password, 0, 9)) {
-+        if (check_range(*password, '0', '9')) {
-             return true;
-         }
-         ++password;
-```
-
-### Task12
-
-问题在于对一个`NULL`解引用并且赋值。
-
-```patch
---- ./task12.c
-+++ ./task12_solution.c
-@@ -11,8 +11,6 @@
- }
-
- void ben(int *arr, int size) {
--    int *ptr = NULL;
--    *ptr = 10;
-     jero(arr, size);
- }
-```
-
-### Task13
-
-问题在于`alloc_str`函数，它没有为字符串末尾的`'\0'`分配空间。
-
-```patch
---- ./task13.c
-+++ ./task13_solution.c
-@@ -7,7 +7,9 @@
- #include <string.h>
-
- char *alloc_str(int len) {
--    return malloc(len*sizeof(char));
-+    char *p = (char *)malloc((len+1)*sizeof(char));
-+    p[len] = '\0';
-+    return p;
- }
-
- /* Str helper functions */
-```
diff --git a/Labs/Solutions/Lab6-Sol/task1.c b/Labs/Solutions/Lab6-Sol/task1.c
deleted file mode 100644
index 2c58427..0000000
--- a/Labs/Solutions/Lab6-Sol/task1.c
+++ /dev/null
@@ -1,23 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-struct Course {
-  int id;
-  char *name;
-};
-
-struct Course *make_course(int id, char *name) {
-  struct Course *new_course = malloc(sizeof(struct Course));
-  new_course->id = id;
-  new_course->name = name;
-
-  return new_course;
-}
-int main() {
-  struct Course *cstart = make_course(0x001, "cstart");
-  printf("Welcome to CS%d: %s!\n", cstart->id, cstart->name);
-  free(cstart);
-
-  return 0;
-}
diff --git a/Labs/Solutions/Lab6-Sol/task12.c b/Labs/Solutions/Lab6-Sol/task12.c
deleted file mode 100644
index f7e06e1..0000000
--- a/Labs/Solutions/Lab6-Sol/task12.c
+++ /dev/null
@@ -1,31 +0,0 @@
-#include <stdlib.h>
-
-void jedi(int *arr, int size);
-void ben(int *arr, int size);
-void jero(int *arr, int size);
-
-void jedi(int *arr, int size) {
-  for (int i = 0; i < size; ++i) {
-    arr[i] = i * 10;
-  }
-}
-
-void ben(int *arr, int size) { jero(arr, size); }
-
-void jero(int *arr, int size) {
-  int *new_arr = (int *)malloc(size * sizeof(int));
-  if (new_arr == NULL) {
-    return;
-  }
-  for (int i = 0; i < size; ++i) {
-    new_arr[i] = arr[i];
-  }
-  jedi(new_arr, size);
-  free(new_arr);
-}
-
-int main() {
-  int arr[10];
-  ben(arr, 10);
-  return 0;
-}
diff --git a/Labs/Solutions/Lab6-Sol/task13.c b/Labs/Solutions/Lab6-Sol/task13.c
deleted file mode 100644
index c6f0a55..0000000
--- a/Labs/Solutions/Lab6-Sol/task13.c
+++ /dev/null
@@ -1,80 +0,0 @@
-/* This program translates words to Bork, a language that is very similar to
-   English. To translate a word to Bork, you take the English word and add an
-   'f' after every vowel in the word. */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-char *alloc_str(int len) {
-  char *p = (char *)malloc((len + 1) * sizeof(char));
-  p[len] = '\0';
-  return p;
-}
-
-/* Str helper functions */
-typedef struct Str {
-  char *data;
-  int len;
-} Str;
-
-Str make_Str(char *str) {
-  /* Below is a designated initializer. It creates a Str struct and initializes
-     its data field to str and its len field to strlen(str) */
-  return (Str){.data = str, .len = strlen(str)};
-}
-
-void free_Str(Str str) { free(str.data); }
-
-/* concatinates two strings together */
-Str concat(Str a, Str b) {
-  int new_len = a.len + b.len;
-  char *new_str = alloc_str(new_len);
-  for (int i = 0; i < a.len; ++i) {
-    new_str[i] = a.data[i];
-  }
-  for (int i = 0; i < b.len; ++i) {
-    new_str[i + a.len] = b.data[i];
-  }
-  free(a.data);
-  free(b.data);
-  return (Str){.data = new_str, .len = new_len};
-}
-
-/* translates a letter to Bork */
-Str translate_to_bork(char c) {
-  switch (c) {
-  case 'a':
-  case 'e':
-  case 'i':
-  case 'o':
-  case 'u': {
-    char *res = alloc_str(2);
-    res[0] = c;
-    res[1] = 'f';
-    return make_Str(res);
-  }
-  }
-  char *res = alloc_str(1);
-  res[0] = c;
-  return make_Str(res);
-}
-
-int main(int argc, char *argv[]) {
-  if (argc == 1) {
-    printf("Remember to give me a string to translate to Bork!\n");
-    return 1;
-  }
-
-  Str dest_str = {}; // Fancy syntax to zero initialize struct
-  Str src_str = make_Str(argv[1]);
-  for (int i = 0; i < src_str.len; ++i) {
-    Str bork_substr = translate_to_bork(src_str.data[i]);
-    dest_str = concat(dest_str, bork_substr);
-  }
-
-  printf("Input string: \"%s\"\n", src_str.data);
-  printf("Length of translated string: %d\n", dest_str.len);
-  printf("Translate to Bork: \"%s\"\n", dest_str.data);
-  return 0;
-}
diff --git a/Labs/Solutions/Lab6-Sol/zuma/include/linkedlist.h b/Labs/Solutions/Lab6-Sol/zuma/include/linkedlist.h
deleted file mode 100644
index 305fdd7..0000000
--- a/Labs/Solutions/Lab6-Sol/zuma/include/linkedlist.h
+++ /dev/null
@@ -1,4 +0,0 @@
-#include "zuma.h"
-
-void delete(zuma *node);
-void insert(zuma *node, zuma *new_node);
diff --git a/Labs/Solutions/Lab6-Sol/zuma/include/zuma.h b/Labs/Solutions/Lab6-Sol/zuma/include/zuma.h
deleted file mode 100644
index c8e302c..0000000
--- a/Labs/Solutions/Lab6-Sol/zuma/include/zuma.h
+++ /dev/null
@@ -1,25 +0,0 @@
-#ifndef __ZUMA_H__
-#define __ZUMA_H__
-
-#include <stdio.h>
-#include <stdlib.h>
-
-struct Zuma {
-  struct Zuma *pre, *nxt;
-  int color, val;
-};
-typedef struct Zuma zuma;
-
-extern zuma *head, *tail;
-extern int len, ans, K;
-
-void match(zuma *node);
-void Insert(int k, int color, int val);
-void Delete(int k);
-void move_back();
-void set_top(int k);
-void init();
-void solve();
-void print_all();
-
-#endif
diff --git a/Labs/Solutions/Lab6-Sol/zuma/makefile b/Labs/Solutions/Lab6-Sol/zuma/makefile
deleted file mode 100644
index 77aa6b3..0000000
--- a/Labs/Solutions/Lab6-Sol/zuma/makefile
+++ /dev/null
@@ -1,22 +0,0 @@
-CC = gcc
-
-CSRC += $(abspath $(shell find ./src -name "*.c"))
-
-INC_FILES += $(abspath $(shell find ./include -name "*.h"))
-INCPATH += $(abspath ./include)
-
-CFLAGS += $(addprefix -I, $(INCPATH))
-CFLAGS += -Wall -Werror
-
-BUILD_DIR = $(abspath ./build)
-TARGET = $(BUILD_DIR)/zuma
-
-$(TARGET): $(CSRC) $(INC_FILES)
-	mkdir -p $(BUILD_DIR)
-	$(CC) $(CSRC) $(CFLAGS) -o $(TARGET)
-
-run: $(TARGET)
-	$(TARGET)
-
-clean:
-	rm -rf $(BUILD_DIR)
diff --git a/Labs/Solutions/Lab6-Sol/zuma/src/linkedlist.c b/Labs/Solutions/Lab6-Sol/zuma/src/linkedlist.c
deleted file mode 100644
index 02e8dbe..0000000
--- a/Labs/Solutions/Lab6-Sol/zuma/src/linkedlist.c
+++ /dev/null
@@ -1,26 +0,0 @@
-#include "linkedlist.h"
-
-void insert(zuma *node, zuma *new_node) {
-  new_node->pre = node;
-  new_node->nxt = node->nxt;
-  if (node->nxt != NULL)
-    node->nxt->pre = new_node;
-  else
-    tail = new_node;
-  node->nxt = new_node;
-  return;
-}
-
-void delete(zuma *node) {
-  if (node == head)
-    head = node->nxt;
-  if (node == tail)
-    tail = node->pre;
-  if (node->pre != NULL)
-    node->pre->nxt = node->nxt;
-  if (node->nxt != NULL)
-    node->nxt->pre = node->pre;
-  free(node);
-  len--;
-  return;
-}
\ No newline at end of file
diff --git a/Labs/Solutions/Lab6-Sol/zuma/src/main.c b/Labs/Solutions/Lab6-Sol/zuma/src/main.c
deleted file mode 100644
index 52a6994..0000000
--- a/Labs/Solutions/Lab6-Sol/zuma/src/main.c
+++ /dev/null
@@ -1,12 +0,0 @@
-#include "zuma.h"
-
-extern int K;
-
-int main() {
-  init();
-  while (1) {
-    K = 0;
-    solve();
-  }
-  return 0;
-}
\ No newline at end of file
diff --git a/Labs/Solutions/Lab6-Sol/zuma/src/zuma.c b/Labs/Solutions/Lab6-Sol/zuma/src/zuma.c
deleted file mode 100644
index 3f921cf..0000000
--- a/Labs/Solutions/Lab6-Sol/zuma/src/zuma.c
+++ /dev/null
@@ -1,147 +0,0 @@
-#include "zuma.h"
-#include "linkedlist.h"
-
-int len;
-zuma *head = NULL, *tail = NULL;
-int ans = 0;
-int K = 0;
-
-void match(zuma *node) {
-  if (node == NULL)
-    return;
-  zuma *l = node, *r = node;
-  int cnt = 1;
-  while (l->pre != NULL && l->color == l->pre->color) {
-    cnt++;
-    l = l->pre;
-  }
-  while (r->nxt != NULL && r->color == r->nxt->color) {
-    cnt++;
-    r = r->nxt;
-  }
-  if (cnt >= 3) {
-    K++;
-    zuma *tmp = l->pre;
-    int sum = 0;
-    int i;
-    for (i = 0; i < cnt; i++) {
-      sum += l->val;
-      zuma *tmp = l;
-      l = l->nxt;
-      delete (tmp);
-    }
-    ans += sum * K;
-    match(tmp);
-  }
-  return;
-}
-
-void Insert(int k, int color, int val) {
-  if (k > len) {
-    printf("illegal operation occurs in Insert");
-    exit(0);
-  }
-  zuma *new_node = (zuma *)malloc(sizeof(zuma));
-  len++;
-  new_node->color = color;
-  new_node->val = val;
-  new_node->pre = NULL;
-  new_node->nxt = NULL;
-  if (k == 0) {
-    tail = new_node;
-    head = new_node;
-    return;
-  }
-  int i;
-  zuma *iter = head;
-  for (i = 0; i < k - 1; i++) {
-    iter = iter->nxt;
-  }
-  insert(iter, new_node);
-  match(new_node);
-  return;
-}
-
-void Delete(int k) {
-  if (k > len) {
-    printf("illegal operation occurs in Delete");
-    exit(0);
-  }
-  int i;
-  zuma *iter = head;
-  for (i = 0; i < k - 1; i++) {
-    iter = iter->nxt;
-  }
-  zuma *tmp = iter->pre;
-  delete (iter);
-  match(tmp);
-  return;
-}
-
-void move_back() {
-  zuma *node = head;
-  head = head->nxt;
-  head->pre = NULL;
-  tail->nxt = node;
-  node->pre = tail;
-  node->nxt = NULL;
-  tail = node;
-  return;
-}
-
-void set_top(int k) {
-  int i;
-  zuma *tmp = head;
-  for (i = 0; i < k - 1; i++) {
-    move_back();
-  }
-  match(tmp);
-  return;
-}
-
-void init() {
-  int N;
-  scanf("%d", &N);
-  int i;
-  for (i = 0; i < N; i++) {
-    int color, val;
-    scanf("%d %d", &color, &val);
-    Insert(len, color, val);
-  }
-  return;
-}
-
-void solve() {
-  int k = 0, T = 0;
-  scanf("%d", &k);
-  if (k == 0) {
-    if (len == 0)
-      ans *= 2;
-    printf("%d\n", ans);
-    fflush(stdout);
-    exit(0);
-  }
-  scanf("%d", &T);
-  if (T == 4) {
-    Delete(k);
-  } else if (T == 5) {
-    set_top(k);
-  } else {
-    int val = 0;
-    scanf("%d", &val);
-    Insert(k, T, val);
-  }
-  return;
-}
-
-void print_all() {
-  printf("DEBUG:BEGIN\n");
-  zuma *iter = head;
-  while (iter != NULL) {
-    printf("DEBUG:%d %d\n", iter->color, iter->val);
-    iter = iter->nxt;
-  }
-  printf("DEBUG:END\n");
-  return;
-}
-
diff --git a/Labs/Solutions/Lab6-Sol/zuma/task67.mk b/Labs/Solutions/Lab6-Sol/zuma/task67.mk
deleted file mode 100644
index cb634d0..0000000
--- a/Labs/Solutions/Lab6-Sol/zuma/task67.mk
+++ /dev/null
@@ -1,35 +0,0 @@
-CC = gcc
-
-BUILD_DIR = $(abspath ./build)
-TARGET = $(BUILD_DIR)/zuma
-
-# 搜索源文件和头文件
-CSRC += $(abspath $(shell find ./src -name "*.c"))
-OBJFILES = $(patsubst $(abspath ./src)/%, $(BUILD_DIR)/%, $(CSRC:.c=.o))
-DEPS = $(OBJFILES:.o=.d)
-
-INC_FILES += $(abspath $(shell find ./include -name "*.h"))
-INCPATH += $(abspath ./include)
-
-CFLAGS += $(addprefix -I, $(INCPATH))
-CFLAGS += -Wall -Werror -MMD
-
-# 生成 .o 文件时，将输出放入 BUILD_DIR 中
-$(BUILD_DIR)/%.o: ./src/%.c
-	mkdir -p $(dir $@)
-	$(CC) $(CFLAGS) -c $< -o $@
-
--include $(DEPS)
-
-# 链接最终的目标文件
-$(TARGET): $(OBJFILES)
-	mkdir -p $(BUILD_DIR)
-	$(CC) $(OBJFILES) $(CFLAGS) -o $(TARGET)
-
-# 运行目标
-run: $(TARGET)
-	$(TARGET)
-
-# 清理目标
-clean:
-	rm -rf $(BUILD_DIR)
\ No newline at end of file
diff --git a/Labs/lab6/Lab6.tar.gz b/Labs/lab6/Lab6.tar.gz
new file mode 100644
index 0000000000000000000000000000000000000000..f6b65bfac14942aa6a22a951e981bf014903d153
GIT binary patch
literal 7139
zcmV<98yw^xiwFP!000001MFOTcN0gJ=Wl(A0(N4X7$I4HBoH!(*Cb3x!U8j#9g<_U
zrIytocRSrJJ5CPg$berMKL~GQFeWxQ1V2bfkS#yH%Z|Dw{gtn<_tvd$wPYC*0%Wu6
zKAO;7ee2eJ)$iV_YEMFHY23Bt^<DwEni?AL-(XWi!27RrZ3)&l1w)O&`ntNNErDPN
zep^_>YnF>&NyC(M#<s+?NYap_&0ls^rhC!*Kk1b~{~tTF@8HLW{B6<KGX^@ivA%u-
z|AX6`8p`}%9||;XVS(2pPU-dk-2dCz5r_bmU0KUrow1%xTRqQwzW3RwttXWB&*3KM
zXV&b4?BczTr89C&NyzLJ5IPUp%(wRKwWD2TTvI=<j+<t?v3u99PUR~}kH$1TA}9Q<
zirJ!RXAHlh?Mg(<c;~K&rkb*9?vlT(^T*A$L=6m6=M3{tDbcDcYLuOF?y{M|TxRGc
zxYrYR2JAx)`wtH8XQx2w+`aDn!ukCCwU^)<3c6y$kJ<f~vzf>C@JxPaG`n&ym$_n%
z_U}7v-<i&@-Oi>{_Utr`onO0^UAj#+{&(t}&$oR$`{2NVf2X>wsWJO{UpDh|ZuxqC
z{<8JWCC9)>w4I%hj59%2xOyu;Kc7tx=Vu>SmoNH!*1{dofck_@r13|>zbs#}7JBW0
zls!I>8@oWX`G>vP^b#=u0u*z6(CS~vF7;Y{_p<3n&Z`M)?mTL9b3U6%Wf%L4?R>24
z+MIoL(H#r;lP!T~e(pQyYmGq1X?yltE1k}-jpipW;j7gvR^Ji`AUbMEGb{{1y4A7u
z7O<xK?9?L|fm%oq(0P0&{8h3|3KO|CwU|v0qRy9ktkLg5pRl4v63M7sBmib%Lyr_2
zfZV0Zrf1!**3?s?K?3aIeQ7U^y1IgSKrqy7?UuFh1ReoK8-UttknBn?yrAf?<`=0Q
zqQky>0RjUo156=2ASB4DsKoud*2Q~XNkDcOnC`)3+4K+*XET}X$~9M7n!e%I2>67X
zi);@)z+T>$V;8K;E7{BxyaXrZCg-g2h5X!VZe<Qe6*kE~o3~akWETgm(P0V}Yw2o!
z9>V!%c6kf}C;zaU1a||faI+^rpW#E0vtb~5X^)KNrk2oV=YNDB7z|@8y+q+v46O8!
zm71_Fez)&14#{=&x`TR)&>g#AUthGAM=01pIE1e88Efut;Z_f-_-r~iGYATx|3+`X
zAjMD%F>7KeH<@a45R4ngnM?V;N7l0^U_z_+mP6sl&<`@^A9ULj(_jMhH;m-a{IWbi
zUO+J%1EVE+ro%|X^rRXlbLMV8wTGukbn+6&YAubRce!r)3uE^9V=_5<k38)J0muO%
zX%9a3SZBZ*xtzN?VFTx@i)fu2KU=9==$5`A`}zV!ggc7$;GBJT+zmAk=SyAzz}w!*
z3^vWKjFUBq1G<b8aKsTv1a`yFNI%M-U$LepKz{pK1_rYGuUq~13b&?cCiY)<Ct&XO
zoV5b}9}N5Hg+DH4YBn=u-*~uQ2v<ZAoFnrvSYbQ`&N1S0B0&xSR{2zq;~=ZI2V&gn
zTd}V#xHb@2b8Ch=XEVb*f^m8QRz(t$+8QpiiU_&Yeu%*A>Ke`-n#&ZiWx-a@>~v3V
zwAZ?O-Wp%!;N=KJ>@Yyd5!`4nrYu3Aa0MVNvrEIopad-&7<4G4CP;kF6}sp99~VPE
zJ&R6RO~DV+Kz=Tb`08=AhymUa#ufJFIzaGX<Zz34<A*Xzk;B3h00aA{NBO6VU=HMe
z<LAPSrxeCONfSK(@LQ|*N9*EU`^Re-Iq3(vJ1H_KHRdu8bD3F~QCzbUJsZpPBw48&
zf(W0vpel??Vuk%0Pk&Ad6aJlEL0Db_u)b~e|6J5y<PmA<0%76GDo)LXC*)-aHHZUy
zJeAAzLzLS0`b3HXZs}Cv{EXF)j)81TlA#0rPMV>yF^)i};+VZd6fZOsWf1$`GXd%p
z1TGIUvn!|98-;V<dR?~>YXLJC&*jFU$aq-j8zFcQj-pYyH%jA@Tk&pgcmZn`wD|-~
zF`NpkgAh6ZX^IL`5=IGl0sQG7r8nFQU^f6fPww$bhl4u_0LBL>$xTcby01_pxK6kN
zvR`T#S{xpZZWH^AGt7+3ET${68clRD%p2WKEjD%zbQEy?1XEx!pL&oIXv$~f5X5u|
zXhIshF;}>Mvm`K^s==;>)IbfCEf;WlJKTLf5|^T$$8e$hM()}zmk)?eiI|&<A}RMI
z<Bj6~PF;mx;r<1|eC`ra(p!YJxirtAd^Ys_ShzZuJGY2|xN;?T;b*{Yn0;0cz~^-U
zDL(H6K6|n>@C)z!_~V0k1IEP}HLwZ=VQ%)SJ=tHP?K`Z{GX&uIPa~p5WuWK481?!7
zdAy{-9{C33E2PHqYkid1c<phIkML9e0!)UBMdI-x>*6FpFO<npB4k%@i=uoIs^b|b
ziM`cBZgzko5ai0IE|qbxM*6d>ck(}72ecG3p5rIZfZ=D>>J3bCe2Tlpq)R}o+!;?c
zaEV>NVu?OCmR%gM=0-pm5QE%+sbFBpTQm?ubT_w|@ELgvq7Q&_ZqdGZg#*%{eZB{M
zbNe3FLzu`Oq30GZLyn@V+>@Al0Slp;05S;b+}tEYhKK-|){~2XPe|tAkQjGh(7HH7
zWr*E9YNxQw;=()vP^91hUBWH0q=(&*qRd9Q1Xd~>DLEWwhTWnmJqw<(My{8clWH5P
z0Lc=BTxIrf1JWKH&po|Q<GX>#^;n|7!Ajp+7$F4_bRpLH%n{r@Oq~@KE$f_>tP{lV
zGW+^$ekSGfg(bs~b+cOjvR$t!Y7L%6u~x2#(CuFkgkftDpyX;8>3RK}T1He40LJx)
zV^YG9;cmcNby1}SNMbFYgQBI7N`W~*Ji4L$ilE19X&8vwvBZFJM__5#oxlG*i3=lH
z-F^HO_;D3#UI;(<A--}q5#UATmSih>QizP{H$8=+0M*jfnO~O2d_GvnW4c_ytZ)A`
z$ZKw1CG=0hSk%H-C*xofYxDul0=HJc$Z=bEJdm@6@J?~*gN1zI<`35Dq@8*Q(E%?A
zne2&CTrk|>$@|I>%E9Y4Zl-Gh%h~iaAg_axm#BOb33~V&s2qh^)3ZE?uON~SFMw%4
zb+7eFA2cf;OGH2CM(UB=_Ql&EH+iT8?t%ek_1{6(-_KjAM*!(J?gOmi{CxI9E;E8_
z`Q<UbMk`seqT_!6te?h0f&(oDj(3qxu|+;Z1a9w)Hb>%e<czGBtY>k)ICC13XyML%
z>I2wL7NJ~<5<H%ChZl|lgm^druxHPYz*|8tR^Sj&KiHRGpecZ&!cr!8{sA}H_ZF<}
zU^z-96{tG<08re;0K{EqF;9_8)~Bgc+*Y9a#R)<l!PeB1{L^XRU25c@*m3&c;C?9V
zoLlrehhSof;}1^&KGKrVni>LM^U?%UqIZGnuDivui3cd9B2l;U_;wd@&OU~0n0~&@
z$Dw+A0Gy$Ufay$CEHOiG)9zUR0xf$%Qly_)!UaKTX=Kmht`AIM&>pg~J6m1ffT8nq
zxbNbEU4H%<#S6l9?<Fxb&*h?go4*g!f)>VnPl2=PDNJT?Zj29jdm~i9%Io57j>hTi
z+9X5{*~m_1I4*!ozQZ!7yAKpXFyI{_IYauwuu1peZ+Z-VG~B+!*3eVy_FbqAaLor0
zc4yjK7-2*#PB=9)ulL$@MKxn#!eW8xp6w8v!F<20G$`trJ@=Ed(c_&lv~N^LyIbo6
z(CrmIF1NPHswpX&%3@M7VTMJCePP79{39$qoOx8T|Kdd@t`F6$(H2@wfEkLo<X!HS
zN*`kTHT_I}p3+Pi7LW#^vOP20Fk9$FJu=_s2cJOS+**c~4OkaGga!8ZR`*y7@I}XR
z*51{&YasMC?@4t7U>azEF*<ZDKR;9qoaN>0;xOX%@PezoyU}LN-pD<EKnBBh{zzTW
z?=-WX+=Vi$#Z?ps9v{Ra&H*)oX?F}y`5X?1`TE@V9}G%R=HEp&VLLTOckse(jNrDs
z={u~pCrxIU5KpbU**0q3<~t&*t!A8QF=pzLY9u66j=EH#fbWFU%1n*Bh4=ksZRI%p
z&-AekFL(_<_L&rO?)2wSSLpaW<{S0dhNf{~Fx(;by~D1jy&;H6g+n2l^cC#?^Yb51
z9(o;TfxrFyuc59fxOx8fCa!h<7yELrG7f&b{~Mcv^_%{G6W50R7tj9q?;qp&=f8nK
zU1MXZ|LX$vO%0ppzi;B&uEf-+9AigM9&A4F;h_T`9Xi(hp>I1hDXLu7>f0`YgS}^%
z(H2ch_~Y;Ue0alnxHPvz?cb^C(dvk%8YVP?X?MgF-7uR~sZFkB-u8r4vDx8Kvj+y0
z)u<9<yLOdH@<&_k|IW2;{u_GaRo4J7f&YQVz$X5`iL0Xj9qf<1nlWC0{|ybnP?`Um
z8bkG)`2Qv@7t*)634fah=V>noVcv`VxX$9xziWr@sDNuG`ulvx<S&wnF5^Pn*zMcN
zT#7cZHEWTXWU_<|;Lm~qj`>o=lyzerC4O-uDXL4(S5`Y&kR{vOWt~MNLxvY7^mX4P
zw9XCQsL8e#c=U`BkyKSHj)JF2z}C>zDueNq#V|K9O=p;>=%JdkHe}UMOr=Av@%jD+
z@3E_)w6!Och+=l}RcTx?nEa)zM-)Rw8=Sxf_~D31-lhRdITnK+U?$cnb>T`Cd2qWC
zgLYkO)ulGxU50UENi||BkSbYJ<D5X=n5MTeN$p~?u7fDt3E&;*^IuvLb!4D#5=1xS
z5)DndNov%iSErIlFjejV<F&|~N^WZhRmj!89lOxg?3ipObr{{$lQL6coG#(6#E<Sf
ze*EO8#}1;J9uL<tzDdqBpw>IV91OU5N(N$3U9kdSUxWV?)pSPLivq!YwWmg4j5BMK
zWz#@r&AR*r5LSyW@9hN{IGN6+FD2aLJ6ln+BZp3$ICKm(5s{%wYOBmn9r^U+p<}h|
zA4iWKI`;XCG~<1$xk?m_wWJ>pQgP2ine^m66{A^EsV6Cc{n+~=u-|%1aANO?o*u<K
zT{lw8b&&{qkE1lG_SVfSp`nlM*icE{=Q-Z%jN><h)ov@>x|dab7O0}P6}9$S&+S*s
zs`gdEfBsd)b!MnewWpuM&ou|?Oq6H&f8T!FVTG+{i+1BGzNE$0;mxnG81M6DEGD7F
zzWQHfF~Z>&O&y~89Y#W3H?RsI(z`XUN%;y%q!ef+U1pzrdcuJfS1Jsc7nlUP|Hft2
zx~<5K?FqV^=xT>5pbatxfGqsBp^#l#67rj@w<)TWz!U|Z1S51}G9fa^MY6F~40S?-
ztfz<+2b|iaR@tb9L?#;stNNk}b>f442&lfBN$it<967?;HF$z~#IumxAtjPx=k{;h
zB3J^zOlwslAOcitCZ$LU0f|OdHFf9nd7VHP@!{7Qk@5=ss*6!lv@V}L<p!?Q#WlPa
zm8-YX5CGj<k)Y;<^M)rVZb29{s!+l=+U1B6Q{*U<TC|Sx*m%ihcg3yhjbnrlNNKf}
zaz(9^%bZz_Y*Bf_#l0nnSCX^cgkDkvl#uZGvez5^UX47P2c^BZB*lINBqb!2=Ju8(
zuo42tb)KZlrG+~#6#Pp(uz?T2z4}L&@-KC*TmRvi=qug;c!~9YUBl-3|BYOg{Z9wu
zuWF1Jtp7v7Kz;f8KZNH$o9qAAf4$WDKdNYa`HxF8{Nl5k5(J(4S8qF(R8?3uGK?a_
z@ArSEex`22?cCDrg0F+kP6pn#uSJ*QQroujbW3C+>2CW#f;F|Y0TIM8(tM$t9e=HD
zYu}nM^?iYsU`Ur*>K)cRi*a%{1-R+cBT+3Yj_ce5d!8S}7i7G#vRZW>wbav6La8Wl
zovYPRC{hv|&<LgWoqk6zRiLi20(D*m>O2b6l`F87w^r65RMg-=T!NA+k&r727;=@^
zuWOy^1~fv6|2%T+@TVu=2{wFEs!FJ`Dj}~bA&)AdimHSvt5RQ7<)mEM6ZNhV{{m%O
zH=q$pw4Xi`RpRPa?cG4IRE_$|YSeqxsQ0K*Ur~+v%4#$e)%d#>uWaZBSC8XuiW%R4
z#)+sSA00U?tMMaWlxopXS&Ig*77ZRP8Y*hhP+5z{q81-Ya<Z}-jjkFWDU|`C(NW^>
z%Da+!y0gg3Rim-88jW5x8a-+>R#c<0vKmdE2_BUbiduPcG`Wf#OzzhdV*?_uLx@mT
zL+kv~R9T@WuR={8g_<fV)I<t7SbacKTXo4aw(|YLxYR+5Qe0@j0!pJLE%xKP9L82c
za<@hf{Aml{&5K{W{u6)C`MSn<(fNPVy85raE)d$R|K7w^p{y%uN+>NGp8mjXGGej=
zT2eP;cduUIJ7xrLv>$MGPdV)l{7Zu72!E)iPPLvcR8E$4QRPn218}en&`FC_8_HL*
z7OO6ytf74XmwM;>3Zg5C<!u%l3_{2vroB}pLUb!Da?7NmFA}*#MU4VqLWI}4pDS{K
z9Kby(Cn8!K-;z3T{4den>@OTtYsD9jC~fiH-A#(=vRqBAHC|bNH~tpqf8A>XfEUdF
zU@%y|{;#iV*!=$Ija-!`yRSooDRWwmDtvD4kaWG4Pi>rT5Ptl1i>yB9?P*!pD!+a{
zb3Vmln$8FnU|t3Gz(4Qtw|m&zZ!6BuJ@h-Je2x>F?O?$G?b4t1Jy$pvqjt2LxC4kg
z#@JCj5*IEy?<XWa>wCUVMXm@O@D5Mz_;Za1ra(%8R`7~23J)pVE+mbk9ZhfN=;2ox
zL~tUb(2didTU)$$)e@j0nn}+xtiwm-6bx`yXjRUk^h9;D2K*CWMf?x_QTQKfXbP^w
z|EA6Q?~Pn|@aOr~r1<v~2E!Gm;rszbEuO(iYHLzz72lFTrw&=~!Y^Nx1enm&5QYw^
ztqH}5`|&8y<pq8DA+5`+3)Y$@{{Ld&>QZze5<D)IqWCXztBO@IDTe2HG9Rl$>y#7D
z;VIJl@g%I$-sG<?VyWunINglrdE#>u06_PP5dv{&EMhqJ0uX0(mUkS|M_f+ekx=m)
z9T3dyYM1fjT2V71+1GAu9F<IIPx1Q}08u1>1c_w4nuHtrd}IeOaL;M?%L%QMe`Ld=
zvZ1u9{EuH0RWTJQ0n+Jyb{JOcy3Cy@@lk~UXxt*9LFa#pX)u(9#S}TgeT1jFoD|-m
z*4`KR^$nMXAEi1cWiUp~*M820AB@&AKX%;f?Qyo4Nip$o?SyP-Y@UqZo^x?68`0E=
zWGX7x#q89?7fBeFtumgJqa4VE2suNkmh0S7%wd@0NFIsH^)_qqbCbL46d*8o4NwdO
z(TOr;g#^r5t;@jBQ)FPSh$jhG;?c4(4-k@%fV^7P@j_!s!c@+4OYym)Uj%E{H$uU)
z&WW^V>PyadMq<V~R(466O|2RK3XI}2B9=y-iW!NsYVpWFi>Z>TcDwho=U(yLYo7aL
z)ox)5a*Yn+c->MbzGi{;Qvozir1%`fXTS`nMND5Ym4KqgG2mI>M*M@qfL`vEIeF_P
zs+3wI&MFq}J5GHrA`r?ve1|n&(DAc-RwB2_{KOh8-Kuo_PdnGrn?@3Z@A(xIOOC+c
z6<{9HqWBQm8%2>gc`vI()&wRS#274Qu)JFF-_!N#?i#>2iH&!q`VRI`(~s)zs_LqK
zOqReQ5teeGmDQVUeg)36)uu+dKQKhjCX_78|E`B{bpDTYK6YmMpLv<yLn+QgEFv?&
z#(}dJ%Q5Hnt;M#qKkrlo&axrOsDzH=>tgkVirf?*$;<N14U5{qdM%V@Tw>ifTzXSq
z7yNW|Tzoph;5x2Hh2sz2Bs`vAW~ux)F$a=)%QeHOPM@u+mj5M(8T~)_%)&E%1oX%E
z|IY^ff$jev0%820;o=|TC+>fC+Z`MKLtu0K^XYt+IhVO8pW^NxVBh+GyHoxC>tN8a
z`0pSH=RZIQ;P3~z=#$KOfLRTQ&OKgC{L0>Rj(dsWMKj@N=T36Mmu{5d(b&{~l7pwL
zW1s%_&N|ief4#GT>Hi_{$fXn6zxxYRJ=zAt-zT?AX9Z5?_ob|7j2HRB`RaFRj=O)A
zbr8%1Vm5sBD!X@K=A2E)w=A8wg35I2^6?v99%&}d)ovyqWdq?Rb)n`K^Ynqt6XcpT
zV_x9V@gwOj$i87Zq1`O*vg<GDcvcfik(Dk~xz))abP6dJ`CaCJVPJ6Wf=Net>5+XL
zg8o0l#b3sc`+wbDuW$a}A)v=U^8KE0GhpxekN(E}-`1dG_WuwF{$K3(ix;@x*~7^|
zex07XnE+N6-Sbe<-Q2)*eD=Ga{^e`l|D;7wA^QTkAjp^D{W=GjCMxe#Wf5JrQ`bAa
zTfb5VzhI>f<|5(-o^~-0DS?l=;z+teHxrt&rJ0WW>-`hgNZYzJC*n<;(^J(4YW%hS
z(}#VZTE_OqfBlX4zu&d^?;zL`|3!`$xLX@%0?7OEcQE~u_D5V2#z*fJsjHK%s_+?J
z99sWT1`e(N-QHkO)&D`;^#35()c>6xf#0YO!5W{T;+V~!sKVW_c|rC7?Fc>Y2;Da3
z-Z0aJb5N9CrdL<vGIBI9&YQy&+Kwz!uI604$a#8>;UH9!^VEw3v0<)|MuTh^RF(Tl
zbsdUbsu>xIT}H(&d1BsGEU>-wll+=n4$PmwP0qY6mE_dy^5#}?LoF^=H^JoMrW`%e
zCSBN|bA`KyMk8E$hnx*85JPk#s;Y#@y}<0!<{bD=NzEnX?K-+K4+HMXgrZMi;s6>A
zwWJJFLGZ-(#_L`<X7CvdJeZ+2P^WpG{hj8?;x=2RaPlHqjK`}bez}7Rm+exxnO<vo
zPP8KnXZDCv*Jq1?SQk%<MkTnlJnF==e&u*~FSvWF4ze6PtUAa-r}jE&YDsgqIJ?0!
zRYZMs(2E5%Zd&5iXUG_~bAzPJ;9EILRyYIv(?ZMRhTpu1mVRZ-6{$MtYVqY)2AB%k
zF~HB&^jJ^mC2OT<1`wmJ5b>|}LbTk3H3o|qvB^UW|2z})LrW6KM;u0kXo%9$nwpM~
z;=EC|DxZ20ES&QnR{G-cJ*yVls8b*ADsnn~)gwq#jMKRjkK@TvGkG(r4`a5fER6KP
zR#qs{B1&lq70B=3(2^mfU`vH-ks<d^!^SSK=XnO)G?Oc_*oys`KM$<69w>NN2WV`6
z!Oot%O*%uRC45xDy<~R3e$7|Kw^~t77OQf*f+!ZQJPTJ)T~}COT_q0J7=4FSJxL`p
zqLPK)CS%yDboJ4;{&lm!)x$j-EwZX>#}}9H{(S%YyUX_<Msh}GtLF1Gj?~xs*tISS
zg#o*j)LdpJ{1F)6WhZoDm!k`PcMco$((a$ZU@#aA27|$1Fc=I5gTY`h7z_r3!C){L
Z3<iV2U@#aA27}>$hVN9QAbS9y005${6}<oe

literal 0
HcmV?d00001

diff --git a/Labs/lab6/README.md b/Labs/lab6/README.md
index 6cce932..ec1269c 100644
--- a/Labs/lab6/README.md
+++ b/Labs/lab6/README.md
@@ -1,5 +1,12 @@
 # Lab6 使用工具
 
+> [!Tip]
+> 1. 学习Makefile [用Makefile代替Python](https://wizardforcel.gitbooks.io/lcthw/content/ex2.html)
+> 2. 学习Valgrind [Valgrind介绍](https://wizardforcel.gitbooks.io/lcthw/content/ex4.html) 
+> 3. 学习GDB [代码调试](https://wizardforcel.gitbooks.io/lcthw/content/ex31.html)
+> 
+>  我们推荐你结合AI来进一步学习这些工具。
+
 ## GCC、多文件编译和Makefile
 
 ### Task1 错误与警告
diff --git a/Labs/lab6/pwd_checker/include/checker.h b/Labs/lab6/pwd_checker/include/checker.h
deleted file mode 100644
index 6485ca9..0000000
--- a/Labs/lab6/pwd_checker/include/checker.h
+++ /dev/null
@@ -1,8 +0,0 @@
-#ifndef PWD_CHECKER_H
-#define PWD_CHECKER_H
-
-#include <stdbool.h>
-
-bool check_password(const char *first_name, const char *last_name, const char *password);
-
-#endif // PWD_CHECKER_H
diff --git a/Labs/lab6/pwd_checker/src/checker.c b/Labs/lab6/pwd_checker/src/checker.c
deleted file mode 100644
index 9f11739..0000000
--- a/Labs/lab6/pwd_checker/src/checker.c
+++ /dev/null
@@ -1,95 +0,0 @@
-#include "checker.h"
-#include <assert.h>
-#include <string.h>
-
-/*
-Password checker
-
-Requirements:
-- Password must be at least 10 characters
-- Password must contain at least
-    - 1 upper case letter
-    - 1 lower case letter
-    - 1 number
-- Password cannot contain the person's first name or last name (case sensitive)
-
-For the simplicity of this exercise:
-- This is not the most efficient way to implement this program
-- These functions do not perform any error checking
-- You can assume that the first and last name will never be the empty string
-*/
-
-/* Returns true if the length of PASSWORD is at least 10, false otherwise */
-bool check_length(const char *password) {
-  int length = strlen(password);
-  bool meets_len_req = (length <= 10);
-  return meets_len_req;
-}
-
-/* Returns true if LETTER is in the range [LOWER, UPPER], false otherwise */
-bool check_range(char letter, char lower, char upper) {
-  bool is_in_range = (letter > lower && letter < upper);
-  return is_in_range;
-}
-
-/* Returns true if PASSWORD contains at least one upper case letter, false
- * otherwise */
-bool check_upper(const char *password) {
-  while (*password != '\0') {
-    bool is_in_range = check_range(*password, 'A', 'Z');
-    if (is_in_range) {
-      return true;
-    }
-    ++password;
-  }
-  return false;
-}
-
-/* Returns true if PASSWORD contains at least one lower case letter, false
- * otherwise */
-bool check_lower(const char *password) {
-  while (*password != '\0') {
-    bool is_in_range = check_range(*password, 'a', 'z');
-    if (is_in_range) {
-      return true;
-    }
-    ++password;
-  }
-  return false;
-}
-
-/* Returns true if PASSWORD contains at least one number, false otherwise */
-bool check_number(const char *password) {
-  while (*password != '\0') {
-    if (check_range(*password, 0, 9)) {
-      return true;
-    }
-    ++password;
-  }
-  return false;
-}
-
-/* Returns true if the person's first and last name are NOT in the password,
- * false otherwise */
-bool check_name(const char *first_name, const char *last_name,
-                const char *password) {
-  /* Type "man strstr" in your terminal to learn what strstr does!
-      To exit the man pages, press 'q' */
-  /* Hint: a NULL pointer will evaluate to False in a logical statement while a
-     non-NULL pointer will evaluate to True */
-  const char *first = strstr(password, first_name);
-  const char *last = strstr(password, last_name);
-  return (!first && !last);
-}
-
-/* Returns true if PASSWORD meets the conditions specified above */
-bool check_password(const char *first_name, const char *last_name,
-                    const char *password) {
-  bool length, upper, lower, number, name;
-  lower = check_lower(password);
-  length = check_length(password);
-  name = check_name(first_name, last_name, password);
-  number = check_number(password);
-  upper = check_upper(password);
-  return (lower && length && name && upper && number);
-}
diff --git a/Labs/lab6/pwd_checker/test/test.c b/Labs/lab6/pwd_checker/test/test.c
deleted file mode 100644
index 7d1e5dd..0000000
--- a/Labs/lab6/pwd_checker/test/test.c
+++ /dev/null
@@ -1,52 +0,0 @@
-#include "checker.h"
-#include <assert.h>
-#include <stdio.h>
-
-int main() {
-  printf("Running tests...\n\n");
-
-  const char *test1_first = "Abraham";
-  const char *test1_last = "Garcia";
-  const char *test1_pwd = "qrtv?,mp!ltrA0b13rab4ham";
-  bool test1 = check_password(test1_first, test1_last, test1_pwd);
-  assert(test1);
-
-  const char *test2_first = "Anjali";
-  const char *test2_last = "Patel";
-  const char *test2_pwd = "Aj8r";
-  bool test2 = check_password(test2_first, test2_last, test2_pwd);
-  assert(!test2);
-
-  const char *test3_first = "Chantelle";
-  const char *test3_last = "Brown";
-  const char *test3_pwd = "QLRIOW815N";
-  bool test3 = check_password(test3_first, test3_last, test3_pwd);
-  assert(!test3);
-
-  const char *test4_first = "Wei";
-  const char *test4_last = "Zhang";
-  const char *test4_pwd = "pjkdihn!o901";
-  bool test4 = check_password(test4_first, test4_last, test4_pwd);
-  assert(!test4);
-
-  const char *test5_first = "John";
-  const char *test5_last = "Smith";
-  const char *test5_pwd = "ALKLIenhLq";
-  bool test5 = check_password(test5_first, test5_last, test5_pwd);
-  assert(!test5);
-
-  const char *test6_first = "Haeun";
-  const char *test6_last = "Kim";
-  const char *test6_pwd = "Ji9anjwHaeun";
-  bool test6 = check_password(test6_first, test6_last, test6_pwd);
-  assert(!test6);
-
-  const char *test7_first = "Adeline";
-  const char *test7_last = "DuBois";
-  const char *test7_pwd = "ALKLIDuBoisen3hLq";
-  bool test7 = check_password(test7_first, test7_last, test7_pwd);
-  assert(!test7);
-
-  printf("Congrats! You have passed all of the test cases!\n");
-  return 0;
-}
diff --git a/Labs/lab6/task1.c b/Labs/lab6/task1.c
deleted file mode 100644
index 8e6c8ca..0000000
--- a/Labs/lab6/task1.c
+++ /dev/null
@@ -1,23 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-struct Course {
-  int id;
-  char *name;
-};
-
-struct Course *make_course(int id, char *name) {
-  struct Course *new_course = malloc(sizeof(struct Course));
-  new_course->id = id;
-  new_course->name = *name;
-
-  return &new_course;
-}
-int main() {
-  struct Course *cstart = make_course(0x001, "cstart");
-  printf("Welcome to CS%d: %s!\n", cstart->id, cstart->name);
-  free(cstart);
-
-  return 0;
-}
diff --git a/Labs/lab6/task12.c b/Labs/lab6/task12.c
deleted file mode 100644
index 7a1d7c9..0000000
--- a/Labs/lab6/task12.c
+++ /dev/null
@@ -1,35 +0,0 @@
-#include <stdlib.h>
-
-void jedi(int *arr, int size);
-void ben(int *arr, int size);
-void jero(int *arr, int size);
-
-void jedi(int *arr, int size) {
-  for (int i = 0; i < size; ++i) {
-    arr[i] = i * 10;
-  }
-}
-
-void ben(int *arr, int size) {
-  int *ptr = NULL;
-  *ptr = 10;
-  jero(arr, size);
-}
-
-void jero(int *arr, int size) {
-  int *new_arr = (int *)malloc(size * sizeof(int));
-  if (new_arr == NULL) {
-    return;
-  }
-  for (int i = 0; i < size; ++i) {
-    new_arr[i] = arr[i];
-  }
-  jedi(new_arr, size);
-  free(new_arr);
-}
-
-int main() {
-  int arr[10];
-  ben(arr, 10);
-  return 0;
-}
diff --git a/Labs/lab6/task13.c b/Labs/lab6/task13.c
deleted file mode 100644
index 84d2a01..0000000
--- a/Labs/lab6/task13.c
+++ /dev/null
@@ -1,76 +0,0 @@
-/* This program translates words to Bork, a language that is very similar to
-   English. To translate a word to Bork, you take the English word and add an
-   'f' after every vowel in the word. */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-char *alloc_str(int len) { return malloc(len * sizeof(char)); }
-
-/* Str helper functions */
-typedef struct Str {
-  char *data;
-  int len;
-} Str;
-
-Str make_Str(char *str) {
-  /* Below is a designated initializer. It creates a Str struct and initializes
-     its data field to str and its len field to strlen(str) */
-  return (Str){.data = str, .len = strlen(str)};
-}
-
-void free_Str(Str str) { free(str.data); }
-
-/* concatinates two strings together */
-Str concat(Str a, Str b) {
-  int new_len = a.len + b.len;
-  char *new_str = alloc_str(new_len);
-  for (int i = 0; i < a.len; ++i) {
-    new_str[i] = a.data[i];
-  }
-  for (int i = 0; i < b.len; ++i) {
-    new_str[i + a.len] = b.data[i];
-  }
-  free(a.data);
-  free(b.data);
-  return (Str){.data = new_str, .len = new_len};
-}
-
-/* translates a letter to Bork */
-Str translate_to_bork(char c) {
-  switch (c) {
-  case 'a':
-  case 'e':
-  case 'i':
-  case 'o':
-  case 'u': {
-    char *res = alloc_str(2);
-    res[0] = c;
-    res[1] = 'f';
-    return make_Str(res);
-  }
-  }
-  char *res = alloc_str(1);
-  res[0] = c;
-  return make_Str(res);
-}
-
-int main(int argc, char *argv[]) {
-  if (argc == 1) {
-    printf("Remember to give me a string to translate to Bork!\n");
-    return 1;
-  }
-
-  Str dest_str = {}; // Fancy syntax to zero initialize struct
-  Str src_str = make_Str(argv[1]);
-  for (int i = 0; i < src_str.len; ++i) {
-    Str bork_substr = translate_to_bork(src_str.data[i]);
-    dest_str = concat(dest_str, bork_substr);
-  }
-
-  printf("Input string: \"%s\"\n", src_str.data);
-  printf("Length of translated string: %d\n", dest_str.len);
-  printf("Translate to Bork: \"%s\"\n", dest_str.data);
-  return 0;
-}
diff --git a/Labs/lab6/zuma/include/linkedlist.h b/Labs/lab6/zuma/include/linkedlist.h
deleted file mode 100644
index 305fdd7..0000000
--- a/Labs/lab6/zuma/include/linkedlist.h
+++ /dev/null
@@ -1,4 +0,0 @@
-#include "zuma.h"
-
-void delete(zuma *node);
-void insert(zuma *node, zuma *new_node);
diff --git a/Labs/lab6/zuma/include/zuma.h b/Labs/lab6/zuma/include/zuma.h
deleted file mode 100644
index 5439fcf..0000000
--- a/Labs/lab6/zuma/include/zuma.h
+++ /dev/null
@@ -1,20 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-
-struct Zuma {
-  struct Zuma *pre, *nxt;
-  int color, val;
-};
-typedef struct Zuma zuma;
-
-extern zuma *head, *tail;
-extern int len, ans, K;
-
-void match(zuma *node);
-void Insert(int k, int color, int val);
-void Delete(int k);
-void move_back();
-void set_top(int k);
-void init();
-void solve();
-void print_all();
\ No newline at end of file
diff --git a/Labs/lab6/zuma/src/linkedlist.c b/Labs/lab6/zuma/src/linkedlist.c
deleted file mode 100644
index 02e8dbe..0000000
--- a/Labs/lab6/zuma/src/linkedlist.c
+++ /dev/null
@@ -1,26 +0,0 @@
-#include "linkedlist.h"
-
-void insert(zuma *node, zuma *new_node) {
-  new_node->pre = node;
-  new_node->nxt = node->nxt;
-  if (node->nxt != NULL)
-    node->nxt->pre = new_node;
-  else
-    tail = new_node;
-  node->nxt = new_node;
-  return;
-}
-
-void delete(zuma *node) {
-  if (node == head)
-    head = node->nxt;
-  if (node == tail)
-    tail = node->pre;
-  if (node->pre != NULL)
-    node->pre->nxt = node->nxt;
-  if (node->nxt != NULL)
-    node->nxt->pre = node->pre;
-  free(node);
-  len--;
-  return;
-}
\ No newline at end of file
diff --git a/Labs/lab6/zuma/src/main.c b/Labs/lab6/zuma/src/main.c
deleted file mode 100644
index 52a6994..0000000
--- a/Labs/lab6/zuma/src/main.c
+++ /dev/null
@@ -1,12 +0,0 @@
-#include "zuma.h"
-
-extern int K;
-
-int main() {
-  init();
-  while (1) {
-    K = 0;
-    solve();
-  }
-  return 0;
-}
\ No newline at end of file
diff --git a/Labs/lab6/zuma/src/zuma.c b/Labs/lab6/zuma/src/zuma.c
deleted file mode 100644
index 3f921cf..0000000
--- a/Labs/lab6/zuma/src/zuma.c
+++ /dev/null
@@ -1,147 +0,0 @@
-#include "zuma.h"
-#include "linkedlist.h"
-
-int len;
-zuma *head = NULL, *tail = NULL;
-int ans = 0;
-int K = 0;
-
-void match(zuma *node) {
-  if (node == NULL)
-    return;
-  zuma *l = node, *r = node;
-  int cnt = 1;
-  while (l->pre != NULL && l->color == l->pre->color) {
-    cnt++;
-    l = l->pre;
-  }
-  while (r->nxt != NULL && r->color == r->nxt->color) {
-    cnt++;
-    r = r->nxt;
-  }
-  if (cnt >= 3) {
-    K++;
-    zuma *tmp = l->pre;
-    int sum = 0;
-    int i;
-    for (i = 0; i < cnt; i++) {
-      sum += l->val;
-      zuma *tmp = l;
-      l = l->nxt;
-      delete (tmp);
-    }
-    ans += sum * K;
-    match(tmp);
-  }
-  return;
-}
-
-void Insert(int k, int color, int val) {
-  if (k > len) {
-    printf("illegal operation occurs in Insert");
-    exit(0);
-  }
-  zuma *new_node = (zuma *)malloc(sizeof(zuma));
-  len++;
-  new_node->color = color;
-  new_node->val = val;
-  new_node->pre = NULL;
-  new_node->nxt = NULL;
-  if (k == 0) {
-    tail = new_node;
-    head = new_node;
-    return;
-  }
-  int i;
-  zuma *iter = head;
-  for (i = 0; i < k - 1; i++) {
-    iter = iter->nxt;
-  }
-  insert(iter, new_node);
-  match(new_node);
-  return;
-}
-
-void Delete(int k) {
-  if (k > len) {
-    printf("illegal operation occurs in Delete");
-    exit(0);
-  }
-  int i;
-  zuma *iter = head;
-  for (i = 0; i < k - 1; i++) {
-    iter = iter->nxt;
-  }
-  zuma *tmp = iter->pre;
-  delete (iter);
-  match(tmp);
-  return;
-}
-
-void move_back() {
-  zuma *node = head;
-  head = head->nxt;
-  head->pre = NULL;
-  tail->nxt = node;
-  node->pre = tail;
-  node->nxt = NULL;
-  tail = node;
-  return;
-}
-
-void set_top(int k) {
-  int i;
-  zuma *tmp = head;
-  for (i = 0; i < k - 1; i++) {
-    move_back();
-  }
-  match(tmp);
-  return;
-}
-
-void init() {
-  int N;
-  scanf("%d", &N);
-  int i;
-  for (i = 0; i < N; i++) {
-    int color, val;
-    scanf("%d %d", &color, &val);
-    Insert(len, color, val);
-  }
-  return;
-}
-
-void solve() {
-  int k = 0, T = 0;
-  scanf("%d", &k);
-  if (k == 0) {
-    if (len == 0)
-      ans *= 2;
-    printf("%d\n", ans);
-    fflush(stdout);
-    exit(0);
-  }
-  scanf("%d", &T);
-  if (T == 4) {
-    Delete(k);
-  } else if (T == 5) {
-    set_top(k);
-  } else {
-    int val = 0;
-    scanf("%d", &val);
-    Insert(k, T, val);
-  }
-  return;
-}
-
-void print_all() {
-  printf("DEBUG:BEGIN\n");
-  zuma *iter = head;
-  while (iter != NULL) {
-    printf("DEBUG:%d %d\n", iter->color, iter->val);
-    iter = iter->nxt;
-  }
-  printf("DEBUG:END\n");
-  return;
-}
-