Trie树学习2

来源：互联网发布：创建目录 linux 编辑：程序博客网时间：2024/05/29 17:47

数组实现的Trie树字符容量有限，可以使用链表实现更为大容量的Trie

#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <vector>#include <map>#include <set>#include <algorithm>#include <cstdlib>#include <list>#include <cmath>using namespace std;#define sigma_size 26#define MAX_LEN 200001struct trie_node{trie_node* next[sigma_size];bool is_terminal;trie_node(){memset(next, 0, sizeof(next));is_terminal = false;}};struct Trie{trie_node* root;int size;int idx(char ch){return ch - 'A';}Trie(){root = new trie_node();size = 1;}void Insert(string str){trie_node* cur = root;int len = str.length();for(int i = 0; i < len; i++){int ch = idx(str[i]);if(cur->next[ch] == NULL){cur->next[ch] = new trie_node();}cur = cur->next[ch];}cur->is_terminal = true;                size++;}bool Query(string str){trie_node* cur = root;int len = str.length();for(int i = 0; i < len; i++){int ch = idx(str[i]);if(cur->next[ch] == NULL){return false;}elsecur = cur->next[ch];}if(cur->is_terminal)return true;elsereturn false;}};

0 0