将二维列表中的值全部拿出来写入一个一维列表中,排序后,二分法查找是否有目标值
class Solution:
def Find(self, target, array):
l=[]
for i in array:
for j in i:
l.append(j)
l.sort()
min=0
max=len(l)-1
while min<=max:
mid=(max+min)//2
if l[mid]==target:
return True
elif l[mid]>target:
max=mid-1
elif l[mid]<target:
min=min+1
else:
return False