hihoCoder 1014 Trie树【python版】

python版的简单字典树：

n = int(raw_input())lis = []for i in range(n):    str = raw_input()    lis.append(str)trie = {}for i in range(n):    p=trie    for ch in lis[i]:        if not p.has_key(ch):            p[ch] = [{}, 0]        p[ch][1] += 1        p = p[ch][0]m = int(raw_input())for i in range(m):    str = raw_input()    p = trie    ans = 0;    cnt=0;    for ch in str:        if not p.has_key(ch):            break        else:            cnt+=1            if cnt == len(str):                ans = p[ch][1]            p = p[ch][0]    print ans