classSolution:deflongestCommonPrefix(self, strs: List[str])->str:iflen(strs)==0:return""iflen(strs)==1:return strs[0]
p =0
nums =[]
lens =len(strs)for i in strs:
nums.append(len(i))
mini =min(nums)for a inrange(mini):for b inrange(lens-1):if strs[b][a]!= strs[b+1][a]:breakelse:
p +=1continuebreakreturn strs[0][:p]
classSolution:deflongestCommonPrefix(self, strs: List[str])->str:ifnot strs:return""
front = strs[0]for i inrange(len(strs)):while strs[i].find(front)!=0:
front = front[:-1]return front