통계 난제 (사전 트 리 나 map 용기)
5373 단어 사전 트 리
사전 트 리 해법
#include
#define N 26
using namespace std;
struct Trie
{
int cnt;
Trie *next[N];
Trie()
{
cnt = 0;
for(int i=0;ivoid insert(string str)//
{
current = root;
for(int i=0;i<str.length();i++)
{
if(current->next[str[i]-'a'] == NULL)
{
temp = new Trie;
current->next[str[i] - 'a'] = temp;
current = current->next[str[i] - 'a'];
}
else
current = current->next[str[i]-'a'];
current->cnt++;//
}
}
int search(char str[])// , , 0,
{
current = root;
int i;
for(i=0; current!=NULL&&istr); i++)
{
current = current->next[str[i]-'a'];
}
if(current != NULL&¤t->cnt>0)//
return current->cnt;
return 0;
}
void del(Trie *root)
{
for(int i=0;iif(root->next[i]!=NULL)
del(root->next[i]);
delete(root);
}
int main()
{
string str;
char s[15];
root = new Trie;
while(getline(cin,str))
{
int len = str.length();
if(len == 0)
break;
insert(str);
}
while(~scanf("%s",s))
{
printf("%d
",search(s));
}
del(root);
return 0;
}
map:
#include
#include
#include
#include
using namespace std;
int main()
{
string s,str;
map<string,int> m;
while(getline(cin,s))
{
int l=s.length();
if(l==0)
break;
for(int i=1;i<=s.length();i++)
{
string s1=s.substr(0,i);
m[s1]++;
}
}
while(cin>>str)
{
cout<//cout << "Hello world!" << endl;
return 0;
}