代码
class Solution(object):
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
samestr = ""
minstr = strs[0]
for i in strs:
if len(i) < len(minstr):
minstr = i
for _, c in enumerate(minstr):
for s in strs:
if s[_] != minstr[_]:
return samestr
samestr += c
return samestr
总结
1、思路:先找到列表中最短的字符串Minstr,然后遍历列表中的全部字符串是否与Minstr有相同子字符串,最后输出最长子字符串。