vault backup: 2026-02-03 20:37:03

.obsidian/workspace.json

@@ -25,6 +25,21 @@
           {
             "id": "a699df623da488e3",
             "type": "leaf",
+            "state": {
+              "type": "markdown",
+              "state": {
+                "file": "Collection/连~都忘记了的小知识.md",
+                "mode": "source",
+                "source": false,
+                "backlinks": false
+              },
+              "icon": "lucide-file",
+              "title": "连~都忘记了的小知识"
+            }
+          },
+          {
+            "id": "bb684fcfc9ac7ba6",
+            "type": "leaf",
             "state": {
               "type": "markdown",
               "state": {
@@ -36,20 +51,6 @@
               "icon": "lucide-file",
               "title": "2026-2-3 周二"
             }
-          },
-          {
-            "id": "ba9747c8bf5f1e5f",
-            "type": "leaf",
-            "state": {
-              "type": "webviewer",
-              "state": {
-                "url": "https://share.note.youdao.com/ynoteshare/index.html?id=a66c778ce8c6e4ee03608e493e59ba7a&type=notebook&_time=1768473840238#/WEB4f51ebc698a96e5cc1a682b2fb7b683d",
-                "title": "CQ2605",
-                "mode": "webview"
-              },
-              "icon": "globe-2",
-              "title": "CQ2605"
-            }
           }
         ],
         "currentTab": 2
@@ -119,12 +120,13 @@
             "state": {
               "type": "outline",
               "state": {
+                "file": "Diary/2026-2/2026-2-3 周二.md",
                 "followCursor": true,
                 "showSearch": false,
                 "searchQuery": ""
               },
               "icon": "lucide-list",
-              "title": "大纲"
+              "title": "2026-2-3 周二 的大纲"
             }
           },
           {
@@ -275,10 +277,16 @@
       "remotely-save:Remotely Save": false
     }
   },
-  "active": "ba9747c8bf5f1e5f",
+  "active": "bb684fcfc9ac7ba6",
   "lastOpenFiles": [
-    "Diary/2026-2/2026-2-3 周二.md",
     "YueQian/相关网站.md",
+    "Collection/连~都忘记了的小知识.md",
+    "Diary/2026-2/2026-2-3 周二.md",
+    "YueQian/Homework/~$2.3作业.docx",
+    "YueQian/Homework/2.3作业.docx",
+    "YueQian/Homework/d94bc2621da31bd2a2cdb32f2900b975.par.temp",
+    "Collection/KMP算法.md",
+    "YueQian/Homework/~WRL0004.tmp",
     "BlogWebsite/Article/Obsidian使用飞牛WebDAV实现多端同步.md",
     "YueQian/Homework/~$2数组与指针作业.doc",
     "Diary/2026-2/2026-2-2 周一.md",
@@ -290,16 +298,12 @@
     "Diary/2026-2/2026-2-1 周日.md",
     "Diary/2026-2",
     "YueQian/Homework/~WRL3723.tmp",
-    "YueQian/Homework/~WRD3715.tmp",
-    "YueQian/Homework/~WRL2286.tmp",
-    "YueQian/Homework/~WRD2278.tmp",
     "Diary/2026-1/2026-1-23 周五.md",
     "Diary/2026-1/2026-1-22 周四.md",
     "Diary/2026-1/2026-1-21 周三.md",
     "Diary/2026-1/2026-1-20 周二.md",
     "Diary/2026-1/2026-1-19 周一.md",
     "Diary/2026-1/2026-1-31 周六.md",
-    "YueQian/Homework/~$数组3.docx",
     "Diary/2026-1/2026-1-30 周五.md",
     "YueQian/Homework/1-29作业.md",
     "YueQian/Homework/1.19-已完成.md",
@@ -309,9 +313,7 @@
     "YueQian/Homework/assets/1-29/file-20260129201415992.png",
     "Diary/2026-1/2026-1-29 周四.md",
     "Diary/2026-1/2026-1-28 周三.md",
-    "Collection/连~都忘记了的小知识.md",
     "Excalidraw/Drawing 20260122.md",
-    "Collection/KMP算法.md",
     "Diary/2026-1/2026-1-27 周二.md",
     "Diary/2026-1/2026-1-26 周一.md",
     "Diary/2026-1/2026-1-25 周日.md",

Collection/KMP算法.md

@@ -23,27 +23,18 @@ KMP算法的时间复杂度为O(n+m)，其中n是主串的长度，m是模式串
 ```c
 
 #include <stdio.h>
-
 #include <string.h>
-
 // 函数原型声明
 
 void computeLPSArray(char *pat, int M, int *lps);
-
 void KMPSearch(char *pat, char *txt);
 
 int main() {
-
 char text[] = "ABABDABACDABABCABAB";
-
 char pattern[] = "ABABCABAB";
-
 printf("Text: %s\n", text);
-
 printf("Pattern: %s\n", pattern);
-
 KMPSearch(pattern, text);
-
 return 0;
 
 }
@@ -68,13 +59,15 @@ lps[i] = len;
 
 	i++;
 
-} else {
+} 
+else {
 
 	if (len != 0) {
 
 		len = lps[len - 1];
 
-} else {
+} 
+else {
 
 	lps[i] = 0;
 
@@ -117,25 +110,16 @@ i++;
 }
 
 if (j == M) {
-
 	printf("Pattern found at index %d \n", i - j);
-
 	j = lps[j - 1];
-
-} else if (i < N && pat[j] != txt[i]) {
-
+} 
+else if (i < N && pat[j] != txt[i]) {
 	if (j != 0)
-
 		j = lps[j - 1];
-
 else
-
 	i = i + 1;
-
 }
-
 }
-
 }
 
 ```

Collection/连~都忘记了的小知识.md

@@ -42,3 +42,4 @@ switch (num)
 }
 ```
 - 函数的名称与数组的名称一样，是函数的首地址
+- `a[i][j] ≡ *(*(a+i)+j) ≡ *(a[i]+j) ≡ (*(a+i))[j]`