HDU1671-Phone List

建立一个Trie树并且每次用完后将它删除并释放内存。

#include <cstdio>
#include <cstring>
#include <cstdlib>

char s[10000+10][100];


struct Trie {
    int cnt;
    Trie *next[10];
};

void init(Trie *rt) {
    rt->cnt = 0;
    for (int i = 0; i < 10; i++) {
        rt->next[i] = NULL;
    }
}

Trie *build() {
    Trie *p = new Trie;
    init(p);
    return p;
}

void insert(Trie *rt, char *s, int len) {
    Trie *p = rt;
    for (int i = 0; i < len; i++) {
        int idx = s[i] - '0';
        if (p->next[idx] == NULL) {
            p->next[idx] = new Trie;
            init(p->next[idx]);
        }
        p = p->next[idx];
        p->cnt++;
    }
}

int search(Trie *rt, char *s, int len) {
    Trie *p = rt;
    for (int i = 0; i < len; i++) {
        int idx = s[i] - '0';
        if (p->next[idx] == NULL) {
            return 0;
        }
        p = p->next[idx];
    }
    return p->cnt;
}

void del(Trie *rt)
{
    for (int i = 0;i <= 9; i++) {
        if (rt->next[i] != NULL) {
            del(rt->next[i]);
        }
    }
    free(rt);
}

int main(int argc, char const *argv[]) {
    int t;
    scanf("%d", &t);
    while (t--) {
        int n;
        scanf("%d", &n);
        Trie *rt = build();
        for (int i = 0; i < n; i++) {
            scanf("%s", s[i]);
            insert(rt, s[i], strlen(s[i]));
        }
        bool ok = true;
        for (int i = 0; i < n; i++) {
            if (search(rt, s[i], strlen(s[i])) > 1) {
                ok = false;
                break;
            }
        }
        puts(ok ? "YES" : "NO");
        del(rt);
    }
    return 0;
}