trie树就是字典树,就是花时间为空间的一种高效查找的数据结构
#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<cstdlib> const int maxn=26; int n,m; char s[51]; typedef struct Trienode { bool isStr,iscove; int step; struct Trienode *next[maxn]; }Trie; int sum; void insert_Trie(Trie *root, const char *s) { if (root==NULL || *s=='