-----原來好久之前就做了,結果後來忘了,唉,真是要多練啊
統計難題
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 18920 Accepted Submission(s): 8348
注意:本題只有一組測試數據,處理到文件結束.
.
#include <stdio.h>
#include "string.h"
#include <stdlib.h>
struct dictree // 結構體定義樹
{
struct dictree *child[26]; //結構體指針數組,一棵樹有26個孩子
int n;
};
struct dictree *root;
void insert (char *source)
{
int len,i,j;
struct dictree *current,*newnode;
len=strlen(source);
current=root;
for(i=0;i<len;i++)
{
if(current->child[source[i]-'a']!=NULL)
{
current=current->child[source[i]-'a']; //將current 的指針移動到其子孫處
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; //
}
}
}
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;
}
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=2;
while(gets(temp),strcmp(temp,"")!=0)
insert(temp);
while(scanf("%s",temp)!=EOF)
{
i=find(temp);
printf("%d\n",i);
}
}