C++ Trie(트라이) 코드

#include <iostream>
#include <string>
using namespace std;

const int ROOT = 1;
int unused = 2;
const int MX = 10000 * 500 + 5; // 최대 등장 가능한 글자의 수
bool chk[MX];
int nxt[MX][26];

int c2i(char c) {
    return c - 'a';
}

void insert(string& s) {
    int cur = ROOT;
    for (auto c : s) {
        if (nxt[cur][c2i(c)] == -1)
            nxt[cur][c2i(c)] = unused++;
        cur = nxt[cur][c2i(c)];
    }
    chk[cur] = true;
}

bool find(string& s) {
    int cur = ROOT;
    for (auto c : s) {
        if (nxt[cur][c2i(c)] == -1)
            return false;
        cur = nxt[cur][c2i(c)];
    }
    return chk[cur];
}

void erase(string& s) {
    int cur = ROOT;
    for (auto c : s) {
        if (nxt[cur][c2i(c)] == -1)
            return;
        cur = nxt[cur][c2i(c)];
    }
    chk[cur] = false;
}



int main(void) {
    for (int i = 0; i < MX; i++)
        fill(nxt[i], nxt[i] + 26, -1);

}

https://juggernaut.tistory.com/entry/%EC%A0%91%EB%AF%B8%EC%82%AC-%ED%8A%B8%EB%9D%BC%EC%9D%B4Suffix-Trie

접미사 트라이(Suffix Trie)

https://namu.wiki/w/%ED%8A%B8%EB%9D%BC%EC%9D%B4

트라이