# t1 = (('a'),('b'))
# t2 = (('c'), ('d'))
# print(list(zip(t1, t2)))
# def func(t):
#     return {t[0]: t[1]}
# m1 = map(func,zip(t1, t2) )
# print(list(m1))
# ==
# m1 = map(lambda t: {t[0]: t[1]}, zip(t1, t2))
# print(list(m1))

# def multipliers():
#     return [lambda x: i*x for i in range(4)]
"""
def  multipliers():retun [lambda x: i*x,lambda x: i*x,lambda x: i*x,lambda x: i*x]
每次循环i都会被重新赋值给，最终i == 3
"""
#
# print([m(2) for m in multipliers()])
# 结果：
# [6, 6, 6, 6]
'''
执行[lambda x: i*x,lambda x: i*x,lambda x: i*x,lambda x: i*x]这个四个函数x都==2，i== 3
'''# 想要产生 0， 2， 4， 6的话，可以修改为生成器表达式，因为生成器默认是取值的时候才会执行的，所以i分别取值为[0,1,2,3]
# def multipliers():
#     return (lambda x: i*x for i in range(4))
# print([m(2) for m in multipliers()])

1 li = [11, 22, 33]
2 new_list = map(lambda a: a + 100, li)输出：[111, 122, 133]

1 li = [11, 22, 33]
2 sl = [1, 2, 3]
3 new_list = map(lambda a, b: a + b, li, sl)
4 print new_list输出：[12, 24, 36]

1 lst = [11,22,33]
2 func2 = reduce(lambda arg1,arg2:arg1+arg2,lst)
3 print 'func2:',func2输出：func2: 66

1 li = [11, 22, 33]
2 new_list = filter(lambda arg: arg > 22, li)3 print new_list输出：[33]

while True:story = "
    从前有个山，山里有座庙，庙里老和尚讲故事，讲的什么呢？   "
    print(story)

def story():s = """从前有个山，山里有座庙，庙里老和尚讲故事，讲的什么呢？"""print(s)while True:story()

def story():s = """从前有个山，山里有座庙，庙里老和尚讲故事，讲的什么呢？"""print(s)story()story()

# def func(n):
#     print('--->', n)
#     func(n+1)
# func(0)  #-->RecursionError: maximum recursion depth exceeded while calling a Python object# python默认的最大递归层数是998层

测试最大递归深度

import sys
# print(sys.getrecursionlimit())  获取最大递归层数
# sys.setrecursionlimit()  设置递归深度

"""setrecursionlimit(n)

Set the maximum depth of the Python interpreter stack to n.  Thislimit prevents infinite recursion from causing an overflow of the Cstack and crashing Python.  The highest possible limit is platform-dependent."""

# def age(n):
#     if n == 1:
#         return 18
#     return age(n-1) + 2
# print(age(5))

递归实例1

# 递归打印list中子元素不包含list的元素
# l1 = [1, [2, [3, [4, [5, [6]]]]]]
# def func(l):
#     for n in l:
#         if type(n) is list:
#             func(n)
#         else:
#             print(n)
#
# func(l1)

递归实例2

menu = {'北京': {'海淀': {'五道口': {'soho': {},'网易': {},'google': {}},'中关村': {'爱奇艺': {},'汽车之家': {},'youku': {},},'上地': {'百度': {},},},'昌平': {'沙河': {'老男孩': {},'北航': {},},'天通苑': {},'回龙观': {},},'朝阳': {},'东城': {},},'上海': {'闵行': {"人民广场": {'炸鸡店': {}}},'闸北': {'火车战': {'携程': {}}},'浦东': {},},'山东': {},
}menu

View Code

l = [menu]
while l:for key in l[-1]:print(key)k = input('input>>').strip()   # 北京if k in l[-1].keys() and l[-1][k]:l.append(l[-1][k])elif k == 'b':l.pop()elif k == 'q':break