本文主要尝试在实践中使用字典树。
实现功能:
统计一组字符串中某前缀出现的次数
#include "stdio.h"
#include "string.h"
#include "stdlib.h"
struct dictree
{
struct dictree *child[26];
bool isWord;//=false;
int n;// 统计一组字符串中某前缀出现的次数
dictree() //构造函数初始化
{
isWord=false;
}
}; //结点结构,有26个子节点
struct dictree *root;
void insert (char *source)
{
int len,i,j;
struct dictree *current,*newnode;
len=strlen(source);
if(len==0) return;
current=root;
for(i=0;i<len;i++)
{
if(current->child[source[i]-'a']!=0) //???为何是这样的判断??
{ //插入字符 已经存在
current=current->child[source[i]-'a'];
current->n=current->n+1;
}
else
{ //不存在 新建 节点加入 字典树中
newnode=(struct dictree *)malloc(sizeof(struct dictree));
for(j=0;j<26;j++) newnode->child[j]=0;
current->child[source[i]-'a']=newnode;
current=newnode;
current->n=1;
}
}
current->isWord=true;//标识 单词的最后一个 字母为 单词结尾
}
int find(char *source)
{
int i,len;
struct dictree *current;
len=strlen(source);
if(len==0) return 0;
current=root;
for(i=0;i<len;i++)
{
if(current->child[source[i]-'a']!=0) //查找该字母是否在字典树中
current=current->child[source[i]-'a'];
else return 0;
}
return current->n;//返回 所查找的前缀在 输入的一组字符串中出现的次数
//bool 返回值判断 给定 的单词是否在之前输入的词库
if(len==0) return false;
current=root;
for(i=0;i<len;i++)
{
if(current->child[source[i]-'a']!=0)
current=current->child[source[i]-'a'];
else return false;
}
return current->isWord;
//
}
int main()
{
char temp[11];
int i,j;
root=(struct dictree *)malloc(sizeof(struct dictree));
for(i=0;i<26;i++)
root->child[i]=0;
root->n=1000;
//while(gets(temp),strcmp(temp,"")!=0)
strcpy(temp,"busy");//b,abc,abd,bcd,abcd,efg,hii
insert(temp);
strcpy(temp,"abc");//b,abc,abd,bcd,abcd,efg,hii
insert(temp);
strcpy(temp,"abd");//b,abc,abd,bcd,abcd,efg,hii
insert(temp);
strcpy(temp,"bcd");//b,abc,abd,bcd,abcd,efg,hii
insert(temp);
//strcpy(temp,"abc");//b,abc,abd,bcd,abcd,efg,hii
//insert(temp);
while(scanf("%s",temp)!=EOF)
{
i=find(temp);
printf("%d\n",i);
}
}