题目描述(简单难度)
解题思路
一位一位的进行比较
python 代码
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
if strs==[] or strs[0]== "":
return ""
length = len(strs)
if length == 1:
return strs[0]
res = ""
b = sorted([len(i) for i in strs])[0]
c = 0
while c < b:
flag = self.aa(strs[0][c], strs[1:],c)
if flag == 1:
res = strs[0][:c+1]
c += 1
else:
return res
return res
def aa(self,bb,ss,c):
flag = 0
for i in range(len(ss)):
flag = bb == ss[0][c]
if flag == 1:
ss = ss[1:]
else:
return ""
return flag
s = Solution()
res = s.longestCommonPrefix(["flower","flow","flight"])
print('.....',res) # fl