匿名函数与二分法应用

# a=lambda x:x*x
# print(a)
# print(a(6))
# print(a.__name__)
# b=lambda x,y:x+y
# print(b)
# print(b(1,3))
# print(b.__name__)
# def func():
#     print("厉害了，中国！")
# a=func
# print(a.__name__)
# lst=[
#     {'id':1,'name':'盖伦','age':48},
#     {'id':2,'name':'德邦','age':30},
#     {'id':3,'name':'纳尔','age':18},
#     {'id':4,'name':'薇恩','age':16}
# ]
# lst1=filter(lambda dic:dic['age']>40,lst)
# print(list(lst1))
# lst1=sorted(lst,key=lambda dic:dic['age'])
# print(lst1)
# lst=[1,2,3,4,5,6,7,8,9,10]
# lst1=filter(lambda i:i%2==1,lst)
# print(lst1)
# print('__iter__'in dir(lst1))
# print('__next__'in dir(lst1))
# print(list(lst1))
# lst1=filter(lambda i:i%2==1,lst)
# print(next(lst1))
# lst=[1,2,3,4,5,]
# lst1=[12,13,14,15]
# lst2=map(lambda x,y:x+y,lst,lst1)
# print(list(lst2))
# import  os
# filePath = "e:python资料视频"
#
# def read(filePath, n):
#     it = os.listdir(filePath)   # 打开文件夹
#     for el in it:
#         #  拿到路径
#         fp = os.path.join(filePath, el) # 获取到绝对路径
#         if os.path.isdir(fp):   # 判断是否是文件夹
#             print("	"*n,el)
#             read(fp, n+1)    # 又是文件夹. 继续读取内部的内容 递归入口
#         else:
#             print("	"*n,el)    # 递归出口
#
# read(filePath, 0)
# import os
# f="e:python：Project"
# def read(f,n):
#     it=os.listdir(f)#读取文件夹下的文件
#     for el in it:
#         fp=os.path.join(f,el)
#         if os.path.isdir(fp):
#             print("	"*n,el)
#             read(fp,n+1)
#         else:
#             print("	"*n,el)
# read(f,0)

# lst = [11,22,33,44,55,66,77,88,99,123,234,345,456,567,678,789,1111]
# n = 567
# left = 0
# right = len(lst) - 1
# count = 1
# while left <= right:
#     middle = (left + right) // 2
#     if n > lst[middle]:
#         left = middle + 1
#     elif n < lst[middle]:
#         right = middle - 1
#     else:
#         print(count)
#         print("存在")
#         print(middle)
#         break
#     count = count + 1
# else:
#     print("不存在")
lst = [11,22,33,44,55,66,77,88,99,123,234,345,456,567,678,789,1111]
n=11
# left=0
# right=len(lst)-1
# count=1
# while left<=right:
#     middle = (left + right) // 2
#     if n>lst[middle]:
#         left=middle+1
#     elif n<lst[middle]:
#         right=middle-1
#     else:
#         print("找到了")
#         print("第%s个数"% middle)
#         print(count)
#         break
#     count=count+1
# else:
#     print("不存在")

# def fn(left,right,n):
#     middle=(left + right) // 2
#     if left>right:
#         return -1
#     else:
#         if n>lst[middle]:
#             left=middle+1
#         elif n<lst[middle]:
#             right=middle-1
#         else:
#             return middle
#         return fn(left,right,n)
# print(fn(0,len(lst)-1,567))