Immediate Decodability HDU - 1305 (字典树 删除 )

An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all codes are in binary, that no two codes within a set of codes are the same, that each code has at least one bit and no more than ten bits, and that each set has at least two codes and no more than eight.

Examples: Assume an alphabet that has symbols {A, B, C, D}

The following code is immediately decodable:
A:01 B:10 C:0010 D:0000

but this one is not:
A:01 B:10 C:010 D:0000 (Note that A is a prefix of C)
Input
Write a program that accepts as input a series of groups of records from input. Each record in a group contains a collection of zeroes and ones representing a binary code for a different symbol. Each group is followed by a single separator record containing a single 9; the separator records are not part of the group. Each group is independent of other groups; the codes in one group are not related to codes in any other group (that is, each group is to be processed independently).
Output
For each group, your program should determine whether the codes in that group are immediately decodable, and should print a single output line giving the group number and stating whether the group is, or is not, immediately decodable.
Sample Input
01
10
0010
0000
9
01
10
010
0000
9
Sample Output
Set 1 is immediately decodable
Set 2 is not immediately decodable

这道题 呢 大意 就是 给你 一些 字符串 ， 然后让你检查 这些字符串里 是否 存在 某一个 字符串 是 其他 字符串的 前缀，一看到这里 就知道 是用 字典树 写的 ，然而 我写的 时候 方法思路 没有错 ，但是 却 一直 WR 最后 检查出来 原来是 字典树 删除 函数 出错啦 ， 下面 是 两种方法， 两种不一样的 思路， 都不难，这里就不解释啦；

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

struct Node
{
    int path;
    int endd;
    char ch;
    Node *next[2];
    Node (char ch = ' ')
    {
        this->ch = ch;
        this->path = this->endd = 0;
        for(int i = 0; i < 2; i++)
            this->next[i] = NULL;
    }
};

Node *temp;
int flag = 0;

void Insert(char *s, Node *root)
{
    temp = root;
    while(*s)
    {
        if(!temp->next[*s-'0'])
            temp->next[*s-'0'] = new Node;
        temp->next[*s-'0']->path++;
        if(temp->next[*s-'0']->endd > 0)
            flag = 1;
        temp = temp->next[*s-'0'];
        s++;
    }
    temp->endd++;
    if(temp->path >= 2)
        flag = 1;
}

void Delete(Node *p)
{
    temp = p;
    for(int i = 0; i < 2; i++)
        if(temp->next[i])
            Delete(temp->next[i]);
    delete(p);
}


int main()
{
    char str[10];
    int countt = 0;

    while(scanf("%s", str) && str[0] != '9')
    {
        Node * root;
        root = new Node;
        Insert(str, root);
        while(scanf("%s", str), str[0] != '9')
        {
            Insert(str, root);
        }

        countt++;
        if(flag == 0)
            printf("Set %d is immediately decodable\n", countt);
        else
            printf("Set %d is not immediately decodable\n", countt);
        Delete(root);
        flag = 0;

    }


    return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

struct Node
{
    int path;
    int endd;
    char ch;
    Node *next[2];
    Node (char ch = ' ')
    {
        this->ch = ch;
        this->path = this->endd = 0;
        for(int i = 0; i < 2; i++)
            this->next[i] = NULL;
    }
};

Node *temp;
Node * root;

int Insert(char *s)
{
    int flag = 0;
    temp = root;
    while(*s)
    {
        if(!temp->next[*s-'0'])
            temp->next[*s-'0'] = new Node, flag = 1;
        temp = temp->next[*s-'0'];
        if(temp->endd > 0)
            return 0;
        s++;
    }
    temp->endd++;
    if(!flag)
        return 0;
    else
        return 1;
}


int main()
{
    char str[10];
    int countt = 0;
    root = new Node;
    int flag = 1;

    while(scanf("%s", str) != EOF)
    {
        if(str[0] == '9')
        {
            countt++;
            if(flag == 1)
                printf("Set %d is immediately decodable\n", countt);
            else
                printf("Set %d is not immediately decodable\n", countt);

            flag = 1;
            delete(root);
            root = new Node;
            continue;
        }
        if(flag)
            flag = Insert(str);
    }


    return 0;
}