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?

題目：要找出一堆字符串的最長公共前綴，或者公共后綴，或者公共字串，要如何做呢？

解法：這明顯是三個(gè)問題，其中前兩個(gè)是等效的，都可以用前綴樹的思想來解決。至于第三個(gè)，應(yīng)該可以用動態(tài)規(guī)劃來解決吧，不過肯定很麻煩。

代碼：

1 // http://www.careercup.com/question?id=5424071030341632 2 // Answer: 3 // A trie can allow you to find the longest common prefix qickly, at the cost of huge space. 4 // By reversing the string, you could find out the longest common postfix in a similar manner. 5 int main() 6 { 7 return 0; 8 }

?

轉(zhuǎn)載于:https://www.cnblogs.com/zhuli19901106/p/3717905.html

總結(jié)

以上是生活随笔為你收集整理的Careercup - Google面试题 - 5424071030341632的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。