字典樹裸題——統計難題

#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>using namespace std;#define N 3010struct Tire{int num;Tire *next[26];};Tire *root;void init() //初始化{root = new Tire;for(int i = 0; i < 26; ++i){root->next[i] = NULL;}}void insert(string word) {int temp, len;Tire *cur;len = word.length();cur = root;for(int i = 0; i < len; ++i){temp = word[i] - 'a';if(cur->next[temp] == NULL)//不存在則建立新的節點{Tire *newTire = new Tire;newTire->num=1;for(int j = 0; j < 26; ++j){newTire->next[j]=NULL;}cur->next[temp]=newTire;//將新節點接到當前節點的next上}else{cur->next[temp]->num++;//注意這個地方,num++的位置，是下一個節點的num++}cur = cur->next[temp];}}/*我第一次錯誤的寫法記憶體沒有釋放完全需要遞迴的釋放而這種釋放只釋放了26次void del(Tire *root) //動態建樹，用完釋放記憶體{for(int i = 0; i < 26; ++i)if(root->next[i] != NULL)delete(root->next[i]);}*/void del(Tire *root) //動態建樹，用完釋放記憶體{    for(int i=0;i<10;++i)    {        if(root->next[i]!=NULL)        del(root->next[i]);    }    delete(root);}//正確的寫法int search(string word){int len, temp;Tire *cur;len = word.length();cur = root;for(int i = 0; i < len; ++i){temp = word[i] - 'a';if(cur->next[temp] == NULL)return 0;cur = cur->next[temp];}return cur->num;}int main(){init();char word[11],ask[11];while(gets(word)){if(word[0]=='\0')break;insert(word);}while(gets(ask)){int count=search(ask);printf("%d\n",count);}del(root); //釋放記憶體return 0;}