diff --git a/.vscode/c_cpp_properties.json b/.vscode/c_cpp_properties.json
index 15a60bd..e849f17 100644
--- a/.vscode/c_cpp_properties.json
+++ b/.vscode/c_cpp_properties.json
@@ -13,7 +13,7 @@
             "compilerPath": "C:\\MinGW\\bin\\gcc.exe",
             "cStandard": "c11",
             "cppStandard": "c++17",
-            "intelliSenseMode": "clang-x64"
+            "intelliSenseMode": "${default}"
         }
     ],
     "version": 4
diff --git a/_03.串/02模式匹配_KMP.c b/_03.串/02模式匹配_KMP.c
new file mode 100644
index 0000000..0b09c04
--- /dev/null
+++ b/_03.串/02模式匹配_KMP.c
@@ -0,0 +1,262 @@
+#include "string.h"
+#include "stdio.h"
+#include "stdlib.h"
+#include "io.h"
+#include "math.h"
+#include "time.h"
+
+#define OK 1
+#define ERROR 0
+#define TRUE 1
+#define FALSE 0
+#define MAXSIZE 100 /* �洢�ռ��ʼ������ */
+
+typedef int Status;   /* Status�Ǻ���������,��ֵ�Ǻ������״̬���룬��OK�� */
+typedef int ElemType; /* ElemType���͸���ʵ������������������Ϊint */
+
+typedef char String[MAXSIZE + 1]; /*  0�ŵ�Ԫ��Ŵ��ij��� */
+
+/* ����һ����ֵ����chars�Ĵ�T */
+Status StrAssign(String T, char *chars)
+{
+	int i;
+	if (strlen(chars) > MAXSIZE)
+		return ERROR;
+	else
+	{
+		T[0] = strlen(chars);
+		for (i = 1; i <= T[0]; i++)
+			T[i] = *(chars + i - 1);
+		return OK;
+	}
+}
+
+Status ClearString(String S)
+{
+	S[0] = 0; /*  ���Ϊ�� */
+	return OK;
+}
+
+/*  ����ַ���T�� */
+void StrPrint(String T)
+{
+	int i;
+	for (i = 1; i <= T[0]; i++)
+		printf("%c", T[i]);
+	printf("\n");
+}
+
+/*  ���Next����ֵ�� */
+void NextPrint(int next[], int length)
+{
+	int i;
+	for (i = 1; i <= length; i++)
+		printf("%d", next[i]);
+	printf("\n");
+}
+
+/* ���ش���Ԫ�ظ��� */
+int StrLength(String S)
+{
+	return S[0];
+}
+
+/* ���ص�ģʽƥ�䷨ */
+int Index(String S, String T, int pos)
+{
+	int i = pos;				   /* i��������S�е�ǰλ���±�ֵ����pos��Ϊ1�����posλ�ÿ�ʼƥ�� */
+	int j = 1;					   /* j�����Ӵ�T�е�ǰλ���±�ֵ */
+	while (i <= S[0] && j <= T[0]) /* ��iС��S�ij��Ȳ���jС��T�ij���ʱ��ѭ������ */
+	{
+		if (S[i] == T[j]) /* ����ĸ�������� */
+		{
+			++i;
+			++j;
+		}
+		else /* ָ��������¿�ʼƥ�� */
+		{
+			i = i - j + 2; /* i�˻ص��ϴ�ƥ����λ����һλ */
+			j = 1;		   /* j�˻ص��Ӵ�T����λ */
+		}
+	}
+	if (j > T[0])
+		return i - T[0];
+	else
+		return 0;
+}
+
+/* ͨ�����㷵���Ӵ�T��next���顣 */
+void get_next(String T, int *next)
+{
+	int i, j;
+	i = 1;
+	j = 0;
+	next[1] = 0;
+	while (i < T[0]) /* �˴�T[0]��ʾ��T�ij��� */
+	{
+		if (j == 0 || T[i] == T[j]) /* T[i]��ʾ��׺�ĵ����ַ���T[j]��ʾǰ׺�ĵ����ַ� */
+		{
+			++i;
+			++j;
+			next[i] = j;
+		}
+		else
+			j = next[j]; /* ���ַ�����ͬ����jֵ���� */
+	}
+}
+
+/* �����Ӵ�T������S�е�pos���ַ�֮���λ�á��������ڣ���������ֵΪ0�� */
+/*  T�ǿգ�1��pos��StrLength(S)�� */
+int Index_KMP(String S, String T, int pos)
+{
+	int i = pos;				   /* i��������S�е�ǰλ���±�ֵ����pos��Ϊ1�����posλ�ÿ�ʼƥ�� */
+	int j = 1;					   /* j�����Ӵ�T�е�ǰλ���±�ֵ */
+	int next[255];				   /* ����һnext���� */
+	get_next(T, next);			   /* �Դ�T���������õ�next���� */
+	while (i <= S[0] && j <= T[0]) /* ��iС��S�ij��Ȳ���jС��T�ij���ʱ��ѭ������ */
+	{
+		if (j == 0 || S[i] == T[j]) /* ����ĸ�����������������㷨������j=0�ж� */
+		{
+			++i;
+			++j;
+		}
+		else			 /* ָ��������¿�ʼƥ�� */
+			j = next[j]; /* j�˻غ��ʵ�λ�ã�iֵ���� */
+	}
+	if (j > T[0])
+		return i - T[0];
+	else
+		return 0;
+}
+
+/* ��ģʽ��T��next��������ֵ����������nextval */
+void get_nextval(String T, int *nextval)
+{
+	int i, j;
+	i = 1;
+	j = 0;
+	nextval[1] = 0;
+	while (i < T[0]) /* �˴�T[0]��ʾ��T�ij��� */
+	{
+		if (j == 0 || T[i] == T[j]) /* T[i]��ʾ��׺�ĵ����ַ���T[j]��ʾǰ׺�ĵ����ַ� */
+		{
+			++i;
+			++j;
+			if (T[i] != T[j])   /* ����ǰ�ַ���ǰ׺�ַ���ͬ */
+				nextval[i] = j; /* ��ǰ��jΪnextval��iλ�õ�ֵ */
+			else
+				nextval[i] = nextval[j]; /* �����ǰ׺�ַ���ͬ����ǰ׺�ַ��� */
+										 /* nextvalֵ��ֵ��nextval��iλ�õ�ֵ */
+		}
+		else
+			j = nextval[j]; /* ���ַ�����ͬ����jֵ���� */
+	}
+}
+
+int Index_KMP1(String S, String T, int pos)
+{
+	int i = pos;				   /* i��������S�е�ǰλ���±�ֵ����pos��Ϊ1�����posλ�ÿ�ʼƥ�� */
+	int j = 1;					   /* j�����Ӵ�T�е�ǰλ���±�ֵ */
+	int next[255];				   /* ����һnext���� */
+	get_nextval(T, next);		   /* �Դ�T���������õ�next���� */
+	while (i <= S[0] && j <= T[0]) /* ��iС��S�ij��Ȳ���jС��T�ij���ʱ��ѭ������ */
+	{
+		if (j == 0 || S[i] == T[j]) /* ����ĸ�����������������㷨������j=0�ж� */
+		{
+			++i;
+			++j;
+		}
+		else			 /* ָ��������¿�ʼƥ�� */
+			j = next[j]; /* j�˻غ��ʵ�λ�ã�iֵ���� */
+	}
+	if (j > T[0])
+		return i - T[0];
+	else
+		return 0;
+}
+
+int main()
+{
+	int i, *p;
+	String s1, s2;
+
+	StrAssign(s1, "abcdex");
+	printf("�Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	printf("\n");
+
+	StrAssign(s1, "abcabx");
+	printf("�Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	printf("\n");
+
+	StrAssign(s1, "ababaaaba");
+	printf("�Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	printf("\n");
+
+	StrAssign(s1, "aaaaaaaab");
+	printf("�Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	printf("\n");
+
+	StrAssign(s1, "ababaaaba");
+	printf("   �Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("   NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	get_nextval(s1, p);
+	printf("NextValΪ: ");
+	NextPrint(p, StrLength(s1));
+	printf("\n");
+
+	StrAssign(s1, "aaaaaaaab");
+	printf("   �Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("   NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	get_nextval(s1, p);
+	printf("NextValΪ: ");
+	NextPrint(p, StrLength(s1));
+
+	printf("\n");
+
+	StrAssign(s1, "00000000000000000000000000000000000000000000000001");
+	printf("����Ϊ: ");
+	StrPrint(s1);
+	StrAssign(s2, "0000000001");
+	printf("�Ӵ�Ϊ: ");
+	StrPrint(s2);
+	printf("\n");
+	printf("�������Ӵ��ڵ�%d���ַ����״�ƥ�䣨����ģʽƥ���㷨��\n", Index(s1, s2, 1));
+	printf("�������Ӵ��ڵ�%d���ַ����״�ƥ�䣨KMP�㷨�� \n", Index_KMP(s1, s2, 1));
+	printf("�������Ӵ��ڵ�%d���ַ����״�ƥ�䣨KMP�����㷨�� \n", Index_KMP1(s1, s2, 1));
+
+	return 0;
+}
diff --git a/_03.串/_b.KMP.c b/_03.串/_b.KMP.c
new file mode 100644
index 0000000..8b7cea3
--- /dev/null
+++ b/_03.串/_b.KMP.c
@@ -0,0 +1,305 @@
+/*
+ * @Author: Xu Bai
+ * @Date: 2019-07-08 21:43:47
+ * @LastEditors: Xu Bai
+ * @LastEditTime: 2019-07-08 22:48:27
+ */
+#include "stdio.h"
+#include "stdlib.h"
+#include "io.h"
+#include "string.h"
+
+#define OK 1
+#define ERROR 0
+#define TRUE 1
+#define FALSE 0
+#define MAXSIZE 100
+
+typedef int Status;
+typedef int ElemType;
+typedef char String[MAXSIZE];
+
+/*����һ����ֵ����chars���ַ���T */
+Status StrAssign(String T, char *chars)
+{
+    int i;
+    if (strlen(chars) > MAXSIZE)
+    {
+        return ERROR;
+    }
+    else
+    {
+        T[0] = strlen(chars);
+        for (i = 1; i <= T[0]; i++)
+        {
+            T[i] = *(chars + i - 1);
+        }
+        return OK;
+    }
+}
+
+/*��մ� */
+Status ClearString(String S)
+{
+    S[0] = 0;
+    return OK;
+}
+
+void StrPrint(String T)
+{
+    int i;
+    for (i = 1; i <= T[0]; i++)
+    {
+        printf("%c ", T[i]);
+    }
+    printf("\n");
+}
+
+/*���next���� */
+void NextPrint(int Next[], int Length)
+{
+    int i;
+    for (i = 1; i <= Length; i++)
+    {
+        printf("%d ", Next[i]);
+    }
+    printf("\n");
+}
+
+int StrLength(String S)
+{
+    return S[0];
+}
+
+/*����ƥ�� */
+int Index(String S, String T, int pos)
+{
+    int i = pos;
+    /*i�������S���±� */
+    int j = 1;
+    /*jΪģʽ��T���±� */
+    while (i <= S[0] && j <= T[0])
+    {
+        if (S[i] == T[j])
+        {
+            ++i;
+            ++j;
+        }
+        else
+        {
+            i = i - j + 2;
+            j = 1;
+        }
+
+        if (j > T[0])
+        {
+            return i - T[0];
+        }
+        else
+        {
+            return 0;
+        }
+    }
+}
+
+/*��������ģʽ��T��Next���� */
+void GetNext(String T, int *Next)
+{
+    int i, j;
+    i = 1;
+    j = 0;
+    Next[1] = 0;
+    while (i < T[0])
+    {
+        if (j == 0 || T[i] == T[j])
+        {
+            ++i;
+            ++j;
+            Next[i] = j;
+        }
+        else
+        {
+            j = Next[j];
+        }
+    }
+}
+
+/*�����Ӵ���ģʽ����T������S�е�pos���ַ�֮��?λ�ã��������ڷ���0 */
+int IndexByKMP(String S, String T, int pos)
+{
+    int i = pos;
+    int j = 1;
+    int next[255];
+    GetNext(T, next);
+    while (i <= S[0] && j <= T[0])
+    {
+        if (j == 0 || S[i] = T[i])
+        {
+            ++i;
+            ++j;
+        }
+        else
+        {
+            j = next[j];
+        }
+    }
+    if (j > T[0])
+    {
+        return i - T[0];
+    }
+    else
+    {
+        return 0;
+    }
+}
+
+/*����Nextval���� */
+void GetNextVal(String T, int *NextVal)
+{
+    int i, j;
+    i = 1;
+    j = 0;
+    NextVal[1] = 0;
+    while (i < T[0])
+    {
+        if (j == 0 || T[i] == T[j])
+        {
+            /*T[i]��ʾ��׺�ĵ����ַ���T[j]ǰ׺ */
+            ++i;
+            ++j;
+            if (T[i] != T[j])
+            {
+                /*����ǰ�ַ���ǰ׺�ַ���ͬ����ǰ��jΪNextVal��iλ�õ�ֵ*/
+                NextVal[i] = j;
+            }
+            else
+            {
+                /*����ǰ׺�ַ���ͬ����ǰ׺�ַ���nextvalֵ��ֵ��nextval��iλ�õ�ֵ */
+                NextVal[i] = NextVal[j];
+            }
+        }
+        else
+        {
+            /*���ַ�����ͬ����j���� */
+            j = NextVal[j];
+        }
+    }
+}
+
+int IndexByKMP2(String S, String T, int pos)
+{
+    /*i��������S��ǰλ���±�ֵ */
+    int i = pos;
+    int j = 1;
+    int next[255];
+    GetNextVal(T, next);
+    while (i <= S[0] && j <= T[0])
+    {
+        /* ��iС��S�ij��Ȳ���jС��T�ij���ʱ��ѭ������ */
+        if (j == 0 || S[i] == T[j])
+        {
+            ++i;
+            ++j;
+        }
+        else
+        {
+            j = next[j];
+            /* j�˻غ��ʵ�λ�ã�iֵ���� */
+        }
+    }
+    if (j > T[0])
+    {
+        return i - T[0];
+    }
+    else
+    {
+        return 0;
+    }
+}
+
+int main()
+{
+   	int i, *p;
+	String s1, s2;
+
+	StrAssign(s1, "abcdex");
+	printf("�Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	printf("--------------------------------\n");
+
+	StrAssign(s1, "abcabx");
+	printf("�Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	printf("--------------------------------\n");
+
+	StrAssign(s1, "ababaaaba");
+	printf("�Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	printf("--------------------------------\n");
+
+	StrAssign(s1, "aaaaaaaab");
+	printf("�Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	printf("--------------------------------\n");
+
+	StrAssign(s1, "ababaaaba");
+	printf("   �Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("   NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	get_nextval(s1, p);
+	printf("NextValΪ: ");
+	NextPrint(p, StrLength(s1));
+	printf("--------------------------------\n");
+
+	StrAssign(s1, "aaaaaaaab");
+	printf("   �Ӵ�Ϊ: ");
+	StrPrint(s1);
+	i = StrLength(s1);
+	p = (int *)malloc((i + 1) * sizeof(int));
+	get_next(s1, p);
+	printf("   NextΪ: ");
+	NextPrint(p, StrLength(s1));
+	get_nextval(s1, p);
+	printf("NextValΪ: ");
+	NextPrint(p, StrLength(s1));
+
+	printf("--------------------------------\n");
+
+	StrAssign(s1, "00000000000000000000000000000000000000000000000001");
+	printf("����Ϊ: ");
+	StrPrint(s1);
+	StrAssign(s2, "0000000001");
+	printf("�Ӵ�Ϊ: ");
+	StrPrint(s2);
+	printf("--------------------------------\n");
+	printf("�������Ӵ��ڵ�%d���ַ����״�ƥ�䣨����ģʽƥ���㷨��\n", Index(s1, s2, 1));
+	printf("�������Ӵ��ڵ�%d���ַ����״�ƥ�䣨KMP�㷨�� \n", Index_KMP(s1, s2, 1));
+	printf("�������Ӵ��ڵ�%d���ַ����״�ƥ�䣨KMP�����㷨�� \n", Index_KMP1(s1, s2, 1));
+
+    getchar();
+    return OK;
+}
\ No newline at end of file