字典樹查找

字典樹查找 像做了一本小字典一樣 有趣  單詞排序和計數這樣的小功能沒有加上去 基本實現一下

---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;
}