摘要:
题目描述 Given N string S[1], S[2]......, S[N], you are to find a pair of strings whose longest common prefix has the largest length.输入 There are multiple... 阅读全文
摘要:
trie树就是字典树,就是花时间为空间的一种高效查找的数据结构#include#include#include#include#includeconst int maxn=26;int n,m;char s[51];typedef struct Trienode{ bool isStr,isc... 阅读全文