更改Tasks

.vscode/tasks.json

@@ -7,7 +7,7 @@
     "cwd":"${workspaceRoot}",
     "problemMatcher": {
         "owner": "cpp",
-        "fileLocation": ["relative", "${workspaceRoot}"],
+        "fileLocation": ["relative", "\\"],
         "pattern": {
             "regexp": "^(.*):(\\d+):(\\d+):\\s+(warning|error):\\s+(.*)$",
             "file": 1,

_01.线性表顺序存储.c

@@ -2,7 +2,7 @@
  * @Author: Xu Bai
  * @Date: 2019-06-25 23:10:17
  * @LastEditors: Xu Bai
- * @LastEditTime: 2019-06-26 22:06:39
+ * @LastEditTime: 2019-06-27 00:14:34
  */
 
 #include "stdio.h"
@@ -77,7 +77,7 @@ Status GetElem(SqList L, ElemType *e, int i)
     {
         return ERROR;
     }
-    *e = L.data[i - 1]; // 返回第i个元素，下标为i -1
+    *e = L.data[i - 1]; // <EFBFBD><EFBFBD><EFBFBD>ص<EFBFBD>i<EFBFBD><EFBFBD>Ԫ<EFBFBD>أ<EFBFBD><EFBFBD>±<EFBFBD>Ϊi -1
     return OK;
 }
 
@@ -88,7 +88,7 @@ int LocateElem(SqList L, ElemType e)
         return ERROR;
     }
     int i;
-    for (i = 0; i < L.length; i++) // 长度为5，下标为0~4
+    for (i = 0; i < L.length; i++) // <EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ5<EFBFBD><EFBFBD><EFBFBD>±<EFBFBD>Ϊ0~4
     {
         if (L.data[i] == e)
         {
@@ -100,19 +100,19 @@ int LocateElem(SqList L, ElemType e)
 
 Status ListInert(SqList *L, ElemType e, int i)
 {
-    // 在第i个位置之前插入新元素e
-    // 初始条件：L存在且不满,且i<=length
+    // <EFBFBD>ڵ<EFBFBD>i<EFBFBD><EFBFBD>λ<EFBFBD><EFBFBD>֮ǰ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>e
+    // <EFBFBD><EFBFBD>ʼ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>L<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҳ<EFBFBD><EFBFBD><EFBFBD>,<2C><>i<=length
     if (L->length == MAXSIZE || i < 1 || i > L->length + 1)
     {
 
         return ERROR;
     }
     int k;
-    // 插入新元素
+    // <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>
     for (k = L->length - 1; k >= i - 1; k--)
     {
         L->data[k + 1] = L->data[k];
-        // 从最后一个位置(length下标)开始移动
+        // <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>λ<EFBFBD><EFBFBD>?(length<74>±<EFBFBD>)<29><>ʼ<EFBFBD>ƶ<EFBFBD>
     }
     L->data[i - 1] = e;
     L->length++;
@@ -164,7 +164,7 @@ int main()
     InitList(&L);
     InitList(&R);
 
-    int n;
+   
     int elem;
     printf("insert \n ");
     for (int k = 1; k < 6; k++)