Competitive-Programmer/Trie.cpp at main · Ibrahim-Hassan74/Competitive-Programmer · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
struct Trie {
    struct Node {
        Node *child[26];
        int IsEnd, Prefix;

        Node() {
           memset(child, 0, sizeof child);
           IsEnd = Prefix = 0;
        }
    };
    Node *root = new Node();
    void insert(string s) {
       Node *cur = root;
       for (auto it: s) {
          int idx = it - 'a';
          if (cur->child[idx] == 0) {
             cur->child[idx] = new Node();
          }
          cur = cur->child[idx];
          cur->Prefix++;
       }
       cur->IsEnd++;
    }
    bool SearchWord(string s) {
       Node *cur = root;
       for (auto it: s) {
          int idx = it - 'a';
          if (cur->child[idx] == 0)return 0;
          cur = cur->child[idx];
       }
       return cur->IsEnd;
    }
    int CountWord(string s) {
       Node *cur = root;
       for (auto it: s) {
          int idx = it - 'a';
          if (cur->child[idx] == 0)return 0;
          cur = cur->child[idx];
       }
       return cur->IsEnd;
    }
    int CountPrefix(string s) {
       Node *cur = root;
       for (auto it: s) {
          int idx = it - 'a';
          if (cur->child[idx] == 0)return 0;
          cur = cur->child[idx];
       }
       return cur->Prefix;
    }
};