Template

template

 2020.06.17 16:34  2023.09.01 18:14  ACM  Template 󰈭 21529字

1 字符串 trie树实现一：数组实现的按键查找 cpp  󰄬 1const int maxn = 2e5 + 10; 2const int maxsize = 26; 3struct TRIE{ 4 int ch[maxn][maxsize]; 5 int flag[maxn]; 6 int top = 1; 7 8 //按照实际条件进行修改 9 inline int getid(char c){return c - 'a';} 10 11 //插入长度为n的字符串s[0,..n - 1] 12 void insert(char s[maxn], int n){ 13 int u = 0; 14 for(int i = 0; i < n; i++){ 15 int id = getid(s[i]); 16 if(!ch[u][id]) ch[u][id] = top++; 17 u = ch[u][id]; 18 } 19 flag[u] = 1; 20 } 21 22 bool query(char s[maxn], int n){ 23 int u = 0; 24 for(int i = 0; i < n; i++){ 25 int id = getid(s[i]); 26 if(!ch[u][id]) return false; 27 u = ch[u][id]; 28 } 29 if(flag[u]) return true; return false; 30 } 31}; 实现二：数组实现的按边查找（左儿子右兄弟优化） ...