qq_45602618的博客

KMP算法是一种字符串模式匹配算法，找到主串中是否存在与子串相同的另一个子串； void get_next(string T, int next[]) { //next数组 int i = 1, j = 0; next[1] = 0; while (i < T.size()) { if (j == 0 || T.ch[i] == T.ch[j]) { i++; j++; next[i] = j; } else j = next[j]; } } int KM.

#include<string> #include<iostream> using namespace std; struct node { node* nxt[26]; int flag; node() { for (int i = 0; i < 26; i++) nxt[i] = nullptr; } }; node* root; void init() { root = new node(); } void ins(string s) { int

kruskal typedef struct s { int a, b; int weight; }Edge; void kruskal(Graph G, Edge* e, int* parent) { sort(e); //按边的权值进行排序 init(parent); //初始化并查集 for (int i = 0; i < G.num; i++) { int a_root = find(parent, e[i].a); int b_root = find(parent

dijistra const int N = 10; int used[N]; //用没有用过 int path[N]; //i的前一个节点 int dist[N]; //最短路径 void f(Graph G, int v) { for (int i = 0; i < N; i++) { used[i] = 0; dist[i] = G.edge[v][i]; if (G.edge[v][i] < Max) path[i] = v; else path[i] = -1; }