HDU1671 字典树

题意：问给定字符串集合中是否存在某个字符串是另一个字符串的前缀情况。
思路：模板题
反思：一定要看清楚输出的格式、大写小写！

#include <iostream>
#include <cstring>
using namespace std;
const int MAXN = 10;
struct Trie
{
    int v;
    Trie* next[MAXN];
};
Trie* root;
void InsertTrie(char* str)
{
    int len = strlen(str);
    Trie* p = root;
    for(int i = 0; i < len; i++)
    {
        int id = str[i] - '0';
        if(p -> next[id] == NULL)
        {
            Trie* q = new Trie;
            q -> v = 1;
            for(int j = 0; j < MAXN; j++)
            {
                q -> next[j] = NULL;
            }
            p -> next[id] = q;
            p = p-> next[id];
        }
        else
        {
            p -> next[id] -> v++;
            p = p -> next[id];
        }
    }
    p -> v = -1;
    return;
}
void DelTrie(Trie* T)
{
    if(T == NULL) return;
    for(int i = 0; i < MAXN; i++)
    {
        if(T -> next[i] != NULL)
            DelTrie(T -> next[i]);
    }
    delete T;
    return;
}
int SearchTrie(char* str)
{
    int len = strlen(str);
    Trie* p = root;
    for(int i = 0; i < len; i++)
    {
        int id = str[i] - '0';
        p = p -> next[id];
        if(p == NULL) return 0;
        if(p->v == -1) return -1;
    }
    return -1;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t; cin >> t;
    char phone[20];
    while(t--)
    {
        bool isOK = true;
        root = new Trie;
        for(int i = 0; i < MAXN; i++)
        {
            root -> next[i] = NULL;
        }
        int n; cin >> n;
        while(n--)
        {
            cin >> phone;
            if(SearchTrie(phone) == -1) isOK = false;
            if(!isOK) continue;
            else
            {
                InsertTrie(phone);
            }
        }
        if(isOK) cout << "YES\n";
        else cout << "NO\n";
        DelTrie(root);
    }
    return 0;
}