左神算法-前缀树【c++实现】

#include <iostream>
#include <string>
using namespace std;
struct Node
{
	int path;
	int end;
	int count = 0;
	Node* nexts[26];
};
class Trie
{
private: 
	Node *root;
public:
	Trie(){
		root = new Node();//每个Node后面都挂26个Node
	}
	void insert(string word)
	{
		if (word.empty())
			return ;
		Node* ptr = root;
		int index = 0;
		for (int i = 0; i < word.size(); i++)
		{
			index = word[i] - 'a';
			if (ptr->nexts[index] == nullptr)
				ptr->nexts[index] = new Node();
			ptr = ptr->nexts[index];
			(*ptr).path++;
		}
		(*ptr).end++;
	}
	int search(string word)
	{
		if (word.empty())
			return 0;
		Node* ptr = root;
		int index = 0;
		for (int i = 0; i < word.size(); i++)
		{
			index = word[i] - 'a';
			ptr = ptr->nexts[index];
		}
		return (*ptr).end;
	}
	void delete_(string word)
	{
		if (search(word) != 0)
		{
			Node* ptr = root;//每次都需要回到根节点
			int index = 0;
			for (int i = 0; i < word.size(); i++)
			{
				index = word[i] - 'a';
				if (--(*(ptr->nexts[index])).path == 0) {//判断时已经相减
					ptr->nexts[index] = nullptr;//重新置空
					return;
				}
				ptr = ptr->nexts[index];
			}
			ptr->end--;
		}
	}
	int prefixNumber(string pre)
	{
		if (pre.empty())
			return 0;
		Node* ptr = root;//每次都需要回到根节点
		int index = 0;
		for (int i = 0; i < pre.size(); i++)
		{
			index = pre[i] - 'a';
			if (ptr->nexts[index]== nullptr) {
				return 0;
			}
			ptr = ptr->nexts[index];
			return ptr->path;
		}
	}
};
int main()
{
	Trie sol;
	sol.insert("hello ya");
	sol.insert("how are you");
	sol.insert("hello ya");
	sol.insert("hello ya");
	sol.insert("hello ya");
	sol.insert("how do you do");
	sol.insert("what's up");
	sol.insert("whoo");
	sol.insert("bye");
	cout<<"repeated word num:"<<sol.search("hello ya")<<endl;
	cout << "repeated prefix num:" << sol.prefixNumber("wh") << endl;;
	sol.delete_("hello ya");
	cout << "repeated word num:" << sol.search("hello ya") << endl;
	system("pause");
	return 0;
}