題目出處:http://acm.hdu.edu.cn/showproblem.php?pid=1251
典型的tire樹也是最簡單的,直接套模板水過~~~~~~
不知道爲什麼用scanf老是出錯,gets就可以。。。
PS:AC代碼:
#include<iostream>
using namespace std;
#define MAX 26
typedef struct TrieNode
{
int nCount;
struct TrieNode *next[MAX];
}TrieNode;//定義結點結構
TrieNode Memory[1000000];
int allocp = 0;
void InitTrieRoot(TrieNode **pRoot)//初始化tire樹
{
*pRoot = NULL;
}
TrieNode *CreateTrieNode()//創建新結點
{
int i;
TrieNode *p;
p = &Memory[allocp++];
p->nCount = 1;
for(i = 0 ; i < MAX ; i++)
{
p->next[i] = NULL;
}
return p;
}
void InsertTrie(TrieNode **pRoot , char *s)//插入一個字符串
{
int i , k;
TrieNode *p;
if(!(p = *pRoot))
{
p = *pRoot = CreateTrieNode();
} i = 0;
while(s[i])
{
k = s[i++] - 'a'; //確定branch
if(p->next[k])
p->next[k]->nCount++;
else
p->next[k] = CreateTrieNode();
p = p->next[k];
}
}
int SearchTrie(TrieNode **pRoot , char *s)//查找一個字符串
{
TrieNode *p;
int i , k;
if(!(p = *pRoot))
{
return 0;
}
i = 0;
while(s[i])
{
k = s[i++] - 'a';
if(p->next[k] == NULL)
return 0;
p = p->next[k];
}
return p->nCount;
}
int main()
{
char s[15];
TrieNode *Root = NULL;
InitTrieRoot(&Root);
while(gets(s)&&s[0])
{
InsertTrie(&Root , s);
}
while(gets(s))
{
printf("%d\n", SearchTrie(&Root , s));
}
return 0;
}