C++博客-ACFirst-随笔分类-Trie树http://www.cppblog.com/zzfmars/category/14643.html行胜于言，孤行无益，思为行先。有所为，有所不为。zh-cnThu, 19 Aug 2010 05:59:53 GMTThu, 19 Aug 2010 05:59:53 GMT60pku1056 ZZhttp://www.cppblog.com/zzfmars/archive/2010/08/19/123963.htmlKevin_ZhangKevin_ZhangThu, 19 Aug 2010 05:53:00 GMThttp://www.cppblog.com/zzfmars/archive/2010/08/19/123963.htmlhttp://www.cppblog.com/zzfmars/comments/123963.htmlhttp://www.cppblog.com/zzfmars/archive/2010/08/19/123963.html#Feedback0http://www.cppblog.com/zzfmars/comments/commentRss/123963.htmlhttp://www.cppblog.com/zzfmars/services/trackbacks/123963.html/*********************************************
判断前缀 基础的Trie树
输入需要斟酌一下
**********************************************/
#include"iostream"
#include"cstdlib"
#define MAXN 10005
#define WORD_LEN 11
using namespace std;
int idx;
struct Trie_node{
    bool visited;
    Trie_node *next[2];
    void init();
}trie[MAXN*WORD_LEN],root;
void Trie_node::init(){
    visited=false;
    memset(next,NULL,sizeof(next));
}
bool insert(char* s)
{
    int i,j;
    Trie_node *p=&root;
    for(i=0;s[i];i++)
    {
        j=s[i]-'0';
        if(p->next[j]==NULL)
        {
            trie[idx].init();
            p->next[j]=&trie[idx++];
        }
        else if(p->next[j]->visited)
        {
            return false;
        }
        p=p->next[j];
    }
    p->visited=true;
    return true;
}
char str[21];
int main(){
    int c=1;
    idx=0;
    bool flag=true;
    while(~scanf(" %s",str))
    {
       if(str[0]=='9')
       {
          if(flag)
          {
             printf("Set %d is immediately decodable\n",c++);
          }
          else
          {
             printf("Set %d is not immediately decodable\n",c++);
          }
          idx=0;
          flag=true;
          root.init();
       }
       else
       {
          if(!insert(str))flag=false;
       }
    }
    return 0;
}

Kevin_Zhang 2010-08-19 13:53 发表评论
]]>