GJune的专栏

#include #include #define MAXSTRLEN 255typedef unsigned char String[MAXSTRLEN + 1];int main(void){ int Index_KMP(String S, String T, int next[], int pos);//利用模式串T的next求T在主串S中第pos个字符之后的位置的KMP算法

1、Θ(n2)算法#include typedef struct { int sum; int left; int right;} subarray;int main(){ subarray max_subarray_n2(int [], int); int a[] = {13, -3, -25, 20, -3, -16, -23, 18, 20, -7, 12, -5