20191113Python打卡习--内置数据结构练习，列表推导式

练习

• 100以内的质数

primes = [2,3,5,7]
for i in range(10,100):
    prime = True
    for j in primes[0:5]:
        if( i%j == 0):
            prime = False
            break
    if prime:
        primes.append(i)
print(primes)

输出：
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]

• 把list转成tuple

tuple(primes)

输出：
(2,
3,
5,
7,
11,
13,
17,
19,
23,
29,
31,
37,
41,
43,
47,
53,
59,
61,
67,
71,
73,
79,
83,
89,
97)

• 反转list

tuple(reversed(tuple(primes)))

或者

tuple(primes[::-1])

输出：
(97,
89,
83,
79,
73,
71,
67,
61,
59,
53,
47,
43,
41,
37,
31,
29,
23,
19,
17,
13,
11,
7,
5,
3,
2)

列表推导式

l = range(12)
t = [i*i for i in l]
print(t)

输出：
[0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121]

t = [i*i for i in l if i%2 != 0]
print(t)

输出：
[1, 9, 25, 49, 81, 121]