C++ --- 字典树

 

#include <iostream>
#include <map>
#include <string>
#include <vector>
#include <queue>
using namespace std;

class TrieTree
{
public:
	TrieTree()
	{
		root_ = new TrieNode('\0');
	}

	~TrieTree()
	{
		queue<TrieNode*> que;
		que.push(root_);
		while (!que.empty())
		{
			TrieNode* cur = que.front();
			que.pop();
			for (auto& pair : cur->nodemap_)
			{
				que.push(pair.second);
			}
			delete cur;
		}
	}

	//添加单词
	void add(const string& word)
	{
		TrieNode* cur = root_;

		for (auto x : word)
		{
			auto it = cur->nodemap_.find(x);
			if (it == cur->nodemap_.end())
			{
				TrieNode* child = new TrieNode(x);
				cur->nodemap_.emplace(x, child);
				cur = child;
			}
			else
			{
				cur = it->second;
			}
		}
		++cur->freqs_;
	}

	void remove(const string& word)
	{
		TrieNode* cur = root_;
		TrieNode* del = root_;
		char delch = word[0];

		int i = 0;
		for (char ch : word)
		{
			auto it = cur->nodemap_.find(ch);
			 //不存在
			if (it == cur->nodemap_.end())
			{
				return;
			}

			//删除一个长单词里面包含了一个短单词
			//或者
			//具有公共前缀，删除前缀后单词的字母
			if (cur->freqs_ > 0 || cur->nodemap_.size() > 1)
			{
				del = cur;
				//当前的map结点中找的是下一个map结点的key
				delch = word[i];
			}

			cur = it->second;

			++i;
		}

		cout << endl;

		//指向了要删除单词的末尾
		if (cur->nodemap_.empty())
		{
			//开始删除
			TrieNode* child = del->nodemap_[delch];
			del->nodemap_.erase(delch);
		
			queue<TrieNode*> que;
			que.push(child);


			while (!que.empty())
			{
				TrieNode* cur = que.front();
				que.pop();
				for (auto& pair : cur->nodemap_)
				{
					que.push(pair.second);
				}
				delete cur;
			}
		}
		else
		{
			cur->freqs_ = 0;
		}
	}



	//查询单词出现的次数
	int query(const string& word)
	{
		TrieNode* cur = root_;
		for (auto x : word)
		{
			auto it = cur->nodemap_.find(x);
			if (it == cur->nodemap_.end())
			{
				return 0;
			}
			else
			{
				cur = it->second;
			}
		}
		return cur->freqs_;
	}

	//遍历字典树
	void preOrder()
	{
		string word;
		vector<string> wordList;

		perOrder(root_, word, wordList);
		for (auto& str : wordList)
		{
			cout << str << endl;
		}
	}


	//前缀搜索
	vector<string> queryPrefix(const string& pre)
	{
		TrieNode* cur = root_;
		for (auto x : pre)
		{
			auto it = cur->nodemap_.find(x);
			if (it == cur->nodemap_.end())
			{
				return {};
			}
			else
			{
				cur = it->second;
			}
		}

		vector<string> wordList;
		perOrder(cur, pre.substr(0, pre.size() - 1), wordList);
		for (auto& val : wordList)
		{
			cout << val << endl;
		}

		return wordList;
	}

private:
	struct TrieNode
	{
		TrieNode(char ch, int freqs = 0)
			:ch_(ch), freqs_(freqs)
		{}

		bool operator()(const TrieNode& node)
		{
			return ch_ < node.ch_;
		}

		char ch_;    //结点字符数据
		int freqs_;  //单词数量
		map<char, TrieNode*> nodemap_;//存储孩子结点数据和结点指针的对应关系
	};


private:
	void perOrder(TrieNode* node, string word, vector<string>& wordList)
	{
		//处理当前结点
		if (node != root_)
		{
			word.push_back(node->ch_);
			if (node->freqs_ != 0)
			{
				wordList.emplace_back(word);
			}
		}
		
		//处理子节点
		for (auto& val : node->nodemap_)
		{
			perOrder(val.second, word, wordList);
		}
	}

private:
	TrieNode* root_;
};


int main()
{
	TrieTree trie;
	trie.add("hello");
	trie.add("hello");
	trie.add("helloo");
	trie.add("hel");
	trie.add("hel");
	trie.add("hel");
	trie.add("china");
	trie.add("ch");
	trie.add("ch");
	trie.add("heword");
	trie.add("hellw");

	trie.preOrder();

	cout << "======================================" << endl;
	cout << "======================================" << endl;
	
	trie.queryPrefix("he");


	cout << "======================================" << endl;
	cout << "======================================" << endl;

	trie.remove("ch");
	trie.remove("hellw");

	trie.preOrder();

	return 0;
}