python12_1day

class TestIterator:
value = 0

def __next__(self):
    self.value += 1
    if self.value > 10: raise StopIteration
    return self.value

def __iter__(self):
    return self

ti = TestIterator()
print(list(ti))
for t in ti:
print(t)

简单生成器

nested = [[1, 2], [3, 4], [5]]

def flatten(nested):
for sublist in nested:
for element in sublist:
yield element # yield返回一个生成器

print(list(flatten(nested)))

递归生成器

def flatten(nested):
try:
for sublist in nested:
for element in sublist:
yield element
except TypeError:
yield nested

通用生成器

def MyGenerator():
value = (yield 1)
value = (yield value)

gen = MyGenerator()

print (gen.next())

print(gen.send(None)) # send()方法中的参数是上一次yield返回的参数
print(gen.send(2))

模拟生成器

def flatten(nested):
result = []
try:
for sublist in nested:
for element in sublist:
result.append(element)
except TypeError:
result.append(nested)
return result

八皇后问题

def conflict(state, nextX):
nextY = len(state)
for i in range(nextY):
if abs(state[i] - nextX) in (0, nextY - i):
return True
return False

def quees(num, state):
if len(state) == num - 1:
for pos in range(num):
if not conflict(state, pos):
yield pos
else:
for pos in range(num):
if not conflict(state, pos):
for result in queens(num, state + (pos,)):
yield (pos,) + result

def queens(num=8, state=()):
for pos in range(num):
if not conflict(state, pos):
if len(state) == num - 1:
yield (pos,)
else:
for result in queens(num, state + (pos,)):
yield (pos,) + result

def prettyprint(solution):
def line(pos, length=len(solution)):
return ‘.’ * (pos) + ‘X’ + ‘.’ * (length - pos - 1)

for pos in solution:
    print(line(pos))

import random

prettyprint(random.choice(list(queens(8))))