字典树_英汉词典

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <fstream>
using namespace std;
#define MAX 26
string str;
int len;
string s1[999999][999999];
struct TrieNode
{
    int count;
string word;
string meanings;
    TrieNode *next[MAX];
    TrieNode(int x):count(x)
{
        for(int i = 0;i < MAX;++i)
{
            next[i] = NULL;
        }
    }
};
TrieNode *root=NULL;
int Insert(string str1,string str2)
{
    int size = str1.size();
    int val;
    TrieNode *p = root;

    for(int i = 0;i < size;i++)
{
val = str1[i] - 'a';
if(p->next[val] == NULL)
{
p->next[val] = new TrieNode(0);
}
p = p->next[val];
    } 
    p->count++;
p->word=str1;
p->meanings=str2;
len++;
return p->count;
}
void Delete()
{
cout<<"输入你要删除的单词:"<<endl;
cin>>str;
    int size = str.size();
    int val;
    TrieNode *p = root;
    for(int i = 0;i < size;++i)
{
        val = str[i] - 'a';
        if(p->next[val] == NULL)
{

            return;
        }