HDOJ 1251

典型字典树

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
using namespace std;
#define MAX 26

typedef struct Trie{
	int v;	
	struct Trie *next[MAX];	
}Trie;

Trie root;

void createTrie(char *str){
	int len = strlen(str);
	Trie * p = &root, *q;
	for(int i = 0;i < len; i++){
		int id = str[i] - 'a';	
		if (p -> next[id] == NULL){
			Trie *q = new Trie;	
			q -> v = 1;	
			for(int j = 0;j < MAX; j++)
				q -> next[j] = NULL;
			p -> next[id] = q;
			p = p -> next[id];
		}	
		else{
			p -> next[id] -> v++;	
			p = p -> next[id];		
		}	
	}
}

int findTrie(char *str){
	int len = strlen(str);
	Trie *p = &root;
	for(int i = 0;i < len; i++){
		int id = str[i] - 'a';
		p = p -> next[id];	
		if (p == NULL)	
			return 0;	
	}
	return p -> v;
}
int main(){
	char str[15];
	for(int i = 0;i < MAX; i++)
		root.next[i] = NULL;
	while(gets(str) && str[0] != '\0')
		createTrie(str);
	memset(str, 0, sizeof(str));	
	while(scanf("%s", str) != EOF){
		int ans = findTrie(str);	
		printf("%d\n", ans);	
	}
	return 0;
}