import re
def flongstr(s):
pb=[]
str2=set(s)
print(str2)
max=0
for i in str2:
pa = re.compile(r'['+i+i.swapcase()+']+')
pa=pa.findall(s)
pb.append(pa)
for j in range(len(pa)):
lenth=len(pa[j])
if lenth>max:
max=lenth
tag=pa[j]
print(tag)
print('懒得注释,自己记录着玩的,有新奇思路的大佬可以相互学习一下,但是禁止囫囵照搬')
def find(num,arr,start,end):
while start<=end:
mid=(start+end+1)>>1
if num>arr[end] or num<arr[0]:
print('-1')
break
elif arr[mid]==num:
print(mid)
break
elif arr[mid]>num:
return find(num,arr,start,mid-1)
else:
return find(num,arr,mid,end)
else:print('-1')
num=int(input('num'))
arr=[]
n=int(input('length of arr'))
for i in range(0,n):
a=int(input('input'))
arr.append(a)
print('懒得注释,自己记录着玩的,有新奇思路的大佬可以相互学习一下,但是禁止囫囵照搬')