Python高级特性之切片迭代列表生成式及生成器详解

L = ['Michael', 'Sarah', 'Tracy', 'Bob', 'Jack']
L[0:3] # ['Michael', 'Sarah', 'Tracy']
L[:3] # ['Michael', 'Sarah', 'Tracy']
L[1:3] # ['Sarah', 'Tracy']
L[-2:] # ['Bob', 'Jack']
L[-2:-1] # ['Bob']

L = list(range(100))
L[:10] # [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
L[-10:] # [90, 91, 92, 93, 94, 95, 96, 97, 98, 99]
L[10:20] # [10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
L[:10:2] # [0, 2, 4, 6, 8]
L[::5] # [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95]
L[:] # [0, 1, 2, 3, ..., 99]

# -*- coding: utf-8 -*-
def trim(s):
    for i in range(0,len(s)):
        if s[0] == ' ':
            s = s[1:]
        elif s[-1] == ' ':
            s = s[:-1]

    return s

for i, value in enumerate(['A', 'B', 'C']):
    print(i, value)

# -*- coding: utf-8 -*-
def findMinAndMax(L):
    max = min = None

    if(len(L)>0):
        L = list(L)
        max = min = L[0]
        for i in L:
            if i>max:
                max = i
            if i<min:
                min = i
    
    return (min,max)

list(range(1, 11)) # [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
[x * x for x in range(1, 11)] # [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]
[x * x for x in range(1, 11) if x % 2 == 0] # [4, 16, 36, 64, 100]
[m + n for m in 'ABC' for n in 'XYZ'] # ['AX', 'AY', 'AZ', 'BX', 'BY', 'BZ', 'CX', 'CY', 'CZ']

# 列表生成式也可以使用两个变量来生成list
d = {'x': 'A', 'y': 'B', 'z': 'C' }
[k + '=' + v for k, v in d.items()] # ['y=B', 'x=A', 'z=C']

L = ['Hello', 'World', 'IBM', 'Apple']
[s.lower() for s in L] # ['hello', 'world', 'ibm', 'apple']

[x for x in range(1, 11) if x % 2 == 0] # Right
[x for x in range(1, 11) if x % 2 == 0 else 0] # WRONG!

[x if x % 2 == 0 else -x for x in range(1, 11)] # Right
[x if x % 2 == 0 for x in range(1, 11)] # WRONG!

# -*- coding: utf-8 -*-
L1 = ['Hello', 'World', 18, 'Apple', None]
L2 = [s.lower() for s in L1 if isinstance(s,str)]

# 生成一个迭代器
g = (x * x for x in range(10))
# 获得下一个元素
next(g) # 0
# for循环遍历
for n in g:
    print(n)

# 斐波拉契数列的生成
def fib(max):
    n, a, b = 0, 0, 1
    while n < max:
        yield b
        a, b = b, a + b
        n = n + 1
    return 'done'

# 调用
f = fib(6)
next(f)

# for循环调用
while True:
    try:
        x = next(g)
        print('g:', x)
    except StopIteration as e:
        print('Generator return value:', e.value)
        break

      1
     / \
    1   1
   / \ / \
  1   2   1
 / \ / \ / \
1   3   3   1

# -*- coding: utf-8 -*-
def triangles():
    levellist = [1]
    n = 1
    while (n<=100):
        yield levellist
        newlist = levellist.copy()
        if (n>=2):
            for i in range(0,n-1):
                newlist[i+1] = levellist[i] + levellist[i+1]
        levellist = newlist.copy()
        n = n + 1
        levellist.append(1)
    return 'done'