python生成器

列表推导式

可以快速得到一个你想要得列表
生成0~100的列表：
ls1 = [x for x in range(101)]
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28,
29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55,
56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82,
83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100]

列表生成器

[] ----------- ()

next(res) 相当于指针，不会回退，直到抛出异常
函数转为列表生成器
实例：斐波那契数列（1 1 2 3 5）

ls = []
def fibonacci(num):
first, second = 1, 1
index = 0
yield关键字：会将函数的返回值返回为一个生成器
while index < num:
ls.append(first)
first, second = second, first + second
index += 1
if __name__ == '__main__':
fibonacci(100)
print(ls)

yield关键字：会将函数的返回值返回为一个生成器

ls = []
def fibonacci(num):
first, second = 1, 1
index = 0
while index < num:
ls.append(first)
first, second = second, first + second
index += 1
def fibnacii2(num):
first, second = 1, 1
index = 0
while index < num:
ls.append(first)
#yield first
first, second = second, first + second
yield first
index += 1
if __name__ == '__main__':
# fibonacci(100)
# print(ls)
res = fibnacii2(10)
print(res)
print(next(res))
print(next(res))
def test_yield(num):
print("-----------start----------")
index = 0
while index < num:
print("--------1-------")
return "哈哈哈哈"
print("---------2--------")
index += 1
if __name__ == '__main__':
test_yield(10)

yield,会记住当前的位置，当你下一次Next（）,会在记住的位置继续执行

def test_yield(num):
print("-----------start----------")
index = 0
while index < num:
print("--------1-------")
yield "哈哈哈哈"
print("---------2--------")
index += 1
if __name__ == '__main__':
res = test_yield(10)
print(res)
print(next(res))
print("第二次调用")
print(next(res))
print("第三次调用")
print(next(res))