字典树查找 像做了一本小字典一样 有趣 单词排序和计数这样的小功能没有加上去 基本实现一下
---C语言实现
---实现了字典树的创建 查找 空间释放
---本次实现以26个小写字母为准
---释放空间为递归释放
#include <stdio.h> #include <stdlib.h> #include <windows.h> #define MAX_LENGTH 26 //以小写字母测试 #define TRUE 1 #define FALSE 0 #define BOOL int typedef struct dictionarytreenode { char *ChineseValue; struct dictionarytreenode *NextLevel[MAX_LENGTH];//指针数组 BOOL IsEnd; } DictionaryTreeNode; //释放空间 递归 void FreeApplySpace(DictionaryTreeNode *Head) { int count; if(!Head->NextLevel) { for(count = 0;count<MAX_LENGTH;count++) { FreeApplySpace(Head->NextLevel[count]); } free(Head); Head = NULL; } } //字典树查找 char* DictionaryTreeSearch(char **arr,int length,char **zh_arr,int zh_length,char *SearchStr) { int count; unsigned int count_in; DictionaryTreeNode *Head = NULL; DictionaryTreeNode *Temp = NULL; BOOL IsSearchSuccess = FALSE; char *ZhResult = NULL; if(arr == NULL || length <= 0||zh_arr == NULL ||zh_length <=0 ||zh_length !=length)return NULL; //建造字典树 Head = (DictionaryTreeNode*)malloc(sizeof(DictionaryTreeNode)); memset(Head,0,sizeof(DictionaryTreeNode)); for(count = 0;count <length;count++) { Temp = Head; for(count_in = 0;count_in<strlen(arr[count]);count_in++) { if(!Temp->NextLevel[arr[count][count_in]-97]) { Temp->NextLevel[arr[count][count_in]-97] = (DictionaryTreeNode*)malloc(sizeof(DictionaryTreeNode)); memset(Temp->NextLevel[arr[count][count_in]-97],0,sizeof(DictionaryTreeNode)); } Temp = Temp->NextLevel[arr[count][count_in]-97]; } Temp->IsEnd = TRUE; Temp->ChineseValue = zh_arr[count]; } //查找 Temp = Head; for(count_in = 0;count_in<strlen(SearchStr);count_in++) { Temp = Temp->NextLevel[SearchStr[count_in]-97]; if( !Temp )break; } if(Temp &&Temp->IsEnd) { IsSearchSuccess = TRUE; ZhResult = Temp->ChineseValue; } //释放空间 递归 FreeApplySpace(Head); if(IsSearchSuccess) return ZhResult; else printf("Not Find This Word\n"); return NULL; } int main() { char *result = NULL; char *str[] = {"apps","apple","aban","car","card","bus","wo"}; char *strZH[] = {"yingyong","pingguo","buhidao","qiche","kapian","gonggongqiche","shuaige"}; char *seacherstr = "buss"; result = DictionaryTreeSearch(str,sizeof(str)/sizeof(str[0]),strZH,sizeof(strZH)/sizeof(strZH[0]),seacherstr); if(result) printf("%s:%s\n",seacherstr,result); system("pause"); return 0; }
