摘要：初尝KMP算法--这个味道酸爽！ 文章借鉴自http://www.cnblogs.com/c-cloud/p/3224788.html 1.kmp算法的原理： 本部分内容转自：http://www.ruanyifeng.com/blog/2013/05/Knuth%E2%80%93Morris%E2 阅读全文

摘要：#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h> //打印函数void Print(int *arr, int len){ int *p = arr; int n = len; w 阅读全文

摘要：#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h>#include<sys/types.h> struct Message{ char name[10]; char age; }; 阅读全文

摘要：#define _CRT_SECURE_NO_WARNGINGS#include<stdio.h>#include<stdlib.h>#include<string.h> typedef struct bintree{ char c; struct bintree * lchild; struct 阅读全文

摘要：#define _CRT_SECURE_NO_WARNGINGS#include<stdio.h>#include<stdlib.h>#include<string.h> typedef struct bintree{ char c; struct bintree * lchild; struct 阅读全文

摘要：#define _CRT_SECURE_NO_WARNGINGS#include<stdio.h>#include<stdlib.h>#include<string.h> typedef struct bintree{ char c; struct bintree * lchild; struct 阅读全文

摘要：希尔排序： #include<stdio.h>#include<stdlib.h>#include<string.h>#include<time.h> #define Max 40//交换数据void swap(int *str, int pos1, int pos2){ int tmp = str 阅读全文

摘要：冒泡排序： #include<stdio.h>#include<stdlib.h>#include<string.h>#include<time.h> #define Max 10//交换数据void swap(int *str, int pos1, int pos2){ int tmp = str 阅读全文

摘要：头文件： #ifndef DOUBLELINKLIST_H#define DOUBLELINKLIST_H #include<stdio.h>#include<stdlib.h> //链表结点typedef struct _DOUBLELISTNODE{ void* data; struct _DO 阅读全文