【Rosalind】Finding a Shared Motif - all()函数的优雅使用

Rosalind习题Finding a Shared Motif

今天完成了Rosalind上这道题目，自己写的代码运行了55.5s，虽然成功得到了正确答案，但是发现讨论区的大佬们从之前的讨论答案怎么不对变成了讨论怎么能让代码更快。
我在学习了一下评论区大家的解法之后，对我的代码稍加修改，在1.4s内就跑出了和之前相同的答案，可见一个逻辑、一个运算或者是一行优雅代码的实现，就能让工作效率倍增。

---

Problem

A common substring of a collection of strings is a substring of every member of the collection. We say that a common substring is a longest common substring if there does not exist a longer common substring. For example, “CG” is a common substring of “ACGTACGT” and “AACCGTATA”, but it is not as long as possible; in this case, “CGTA” is a longest common substring of “ACGTACGT” and “AACCGTATA”.

Note that the longest common substring is not necessarily unique; for a simple example, “AA” and “CC” are both longest common substrings of “AACC” and “CCAA”.

Given: A collection of k (k≤100) DNA strings of length at most 1 kbp each in FASTA format.