Python#内置函数&结尾

内围起函数&下开局
zip: 可以把多个可迭代内容进行合并
sorted:排序
filter: 筛选
map: 映射

#         0       1      2
# lst1 = ["赵某某","范某","苏某某"]
# lst2 = [40,38,42]
# lst3 = ["卖拐","耳朵大有福","情深深雨蒙蒙"]

# result = [] 
# for i in range(len(lst1)): # 返回字符串数量
#     frist = lst1[i]
#     second = lst2[i]
#     third = lst3[i]
#     result.append((frist,second,third))
# print(result)

# result = []
# result = zip(lst1,lst2,lst3)
# # print(dir(result))
# # for item in result:
# #     print(item)
# lst = list(result)
# print(lst)

# a = 188
# print(locals())  # 此时locals被写在了全局作用域范围内，此时看到的就是全局作用域中的内容

#
# def func():
#     a = 336
#     print(locals()) #此时locals放在局部作用域范围，看到的就是局部作用域的内容
#
# func()

# c = 12
# print(globals())  # globals 看到的是全局作用域中的内容

# def func():
#     a = 336
#     print(globals())
#
# ret = func()
# print(ret)

# lst = [16,22,68,1,147,256,49]
# s = sorted(lst,reverse=True) # reverse 翻转
# print(s)

#       1      3      2      4       123132
# lst = ["秋","张二嘎","比克","卡卡罗特","超级宇宙无敌大帅B"]

# def func(item): #　item对应的就是列表中的第一项数据
#     return len(item)

#  func = lambda x:len(x)  简化如下
# func ??? 用不着
# s = sorted(lst,key=lambda x:len(x))
# print(s)
# 从小到大排序
# lst = [
#     {"id":1,"name":"周某发","age":"18","salary":"56000"},
#     {"id":2,"name":"周某驰","age":"28","salary":"560800"},
#     {"id":3,"name":"周某茜","age":"78","salary":"56300"},
#     {"id":4,"name":"周伯通","age":"68","salary":"356000"},
#     {"id":5,"name":"周大兴","age":"38","salary":"256000"},
#     {"id":6,"name":"周周有辣","age":"58","salary":"156000"},
#     {"id":7,"name":"周扒皮","age":"8","salary":"560020"},
# ]

# 1.根据每个人的年龄排序
# s = sorted(lst,key=lambda d:d['age'])
# print(s)

# 2.根据工资进行排序，从大到小
# s1 = sorted(lst,key=lambda d:d['salary'])
# print(s1)
#       T         T      T         F          F
# lst = ["张无忌","张三丰","张翠山","灭绝小师太","小狐仙"]
# #                 x:not x 筛选姓张的之外的姓名
# f = filter(lambda x: x.startswith("张"),lst)
# print(list(f))
lst = [1,2,3,4,5,6,7,8,9]

# result = [item * item for item in lst]
# print(result)


r = map(lambda x:x*x ,lst)
print(list(r))

关于函数的最后结尾：
递归： 函数自己调用自己

			递归如果没有任何东西拦截的话，它默认就是一个死循环
			python默认是有递归深度的限制的，默认的最大递归深度是1000

# def func():
#     print(123)
#     return 999
#     func()
#
# func()

# import sys
#
# print(sys.getrecursionlimit())
# # sys.setrecursionlimit(2000)

# def xxx(a,b,c):
#
#     print(123)
#
#     return xxxx
#
# xxx()