class Solution:
def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:
myset=set()
ans=0
for arr in arr1:
string=''
for c in str(arr):
string+=c
myset.add(string)
for arr in arr2:
string=''
arr=str(arr)
for i in range(len(arr),0,-1):
if arr[:i] in myset:
ans=max(ans,i)
break
return ans
所有前缀放到set中
class Solution:
def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:
prefix=set()
for x in arr1:
while x:
prefix.add(x)
x//=10
ans=0
for x in arr2:
while x:
if x in prefix:
ans=max(ans,len(str(x)))
break
else:
x//=10
return ans