competitive-programming/trie.cpp at main · dryeab/competitive-programming · 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
#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

class TrieNode {
   public:
    TrieNode *children[26] = {NULL};
    bool isEnd = false;
};

class Trie {
   public:
    TrieNode *root;

    Trie() {
        root = new TrieNode();
    }

    void insert(string word) {
        TrieNode *iter = root;
        for (auto &c : word) {
            int idx = c - 'a';
            if (!iter->children[idx])
                iter->children[idx] = new TrieNode();
            iter = iter->children[idx];
        }
    }

    bool find(string word) {
        TrieNode *iter = root;
        for (auto &c : word) {
            int idx = c - 'a';
            if (!iter->children[idx])
                return false;
            iter = iter->children[idx];
        }
        return iter->isEnd;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
}