2014-05-08 22:55
原题：
Given a list of strings. Produce a list of the longest common suffixes. If it asks for longest common substring, then building a suffix tree should be the way to go. But how should we implement this if it is for longest common suffixes?
题目：要找出一堆字符串的最长公共前缀，或者公共后缀，或者公共字串，要如何做呢？
解法：这明显是三个问题，其中前两个是等效的，都可以用前缀树的思想来解决。至于第三个，应该可以用动态规划来解决吧，不过肯定很麻烦。
代码：
// http://www.careercup.com/question?id=5424071030341632
// Answer:
// A trie can allow you to find the longest common prefix qickly, at the cost of huge space.
// By reversing the string, you could find out the longest common postfix in a similar manner.
int main()
{
return ;
}