2021.02.25

2021.02.25

字典树

代码：

#include<cstdio>
#include<stdlib.h>
#include<string.h>
#include<string>
#include<map>
#include<cmath>
#include<iostream>
#include <queue>
#include <stack>
#include<algorithm>
#include<set>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int M = 1e6 + 10;
ll s[M];
int tot = 1;
int t[M][26], num[M];
void insert(string a)
{
	int root = 0;
	for (int i = 0; i < a.length(); i++)
	{
		int id = a[i] - 'a';
		if (!t[root][id])
			t[root][id] = tot++;
		root = t[root][id];
		num[root]++;
	}
}
int search(string a)
{
	int root = 0;
	for (int i = 0; i < a.length(); i++)
	{
		int id = a[i] - 'a';
		if (!t[root][id])
			return 0;
		root = t[root][id];
	}
	return num[root];
}
int main() {
	string s;
	while (getline(cin,s))
	{	
		if (s.length() == 0)
			break;
		insert(s);
	}
	while (cin >> s)
		cout << search(s) << endl;
	return 0;
}