class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
if not strs:
return ''
s1, s2 = min(strs), max(strs)
for i in range(len(s1)):
if s1[i] != s2[i]:
return s1[:i]
return s1
找到长度最短的字符串,遍历对比
class Solution:
def longestCommonPrefix(self,strs:List[str]) -> str:
if not strs:
return ''
s1,s2 = min(strs),max(strs)
for i in range(len(s1)):
if s1[i] != s2[i]:
return s1[:i]
return s1
class Solution:
def longestCommonPrefix(self,strs:List[str]) -> str:
if not strs:
return ''
s1,s2 = min(strs),max(strs)
for i in range(len(s1)):
if s1[i] != s2[i]:
return s1[:i]
return s1
class Solution:
def longestCommonPrefix(self,strs:List[str])-> str:
if not strs:
return ''
s1,s2 = min(strs),max(strs)
for i in range(len(s1)):
if s1[i] !=s2[i]:
return s1[:i]
return s1