版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_22795513/article/details/80655705
class Solution(object):
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
rstr = ''
if strs == []:
return rstr
old = strs[0]
for i in range(len(old)): #i为第一个元素的遍历单个字符
for j in range(len(strs)):
try:
if old[i] == strs[j][i]:
pass
else:
return rstr
except:
return rstr
else:
rstr += old[i]
return rstr