标签:
目录[+]
从我开始学习python的时候,我就开始自己总结一个python小技巧的集合。后来当我什么时候在Stack Overflow
或者在某个开源软件里看到一段很酷代码的时候,我就很惊讶:原来还能这么做!,当时我会努力的自己尝试一下这段代码,直到我懂了它的整体思路以后,我就把这段代码加到我的集合里。这篇博客其实就是这个集合整理后一部分的公开亮相。如果你已经是个python大牛,那么基本上你应该知道这里面的大多数用法了,但我想你应该也能发现一些你不知道的新技巧。而如果你之前是一个c,c++,java的程序员,同时在学习python,或者干脆就是一个刚刚学习编程的新手,那么你应该会看到很多特别有用能让你感到惊奇的实用技巧,就像我当初一样。
每一个技巧和语言用法都会在一个个实例中展示给大家,也不需要有其他的说明。我已经尽力把每个例子弄的通俗易懂,但是因为读者对python的熟悉程度不同,仍然可能难免有一些晦涩的地方。所以如果这些例子本身无法让你读懂,至少这个例子的标题在你后面去google搜索的时候会帮到你。
整个集合大概是按照难易程度排序,简单常见的在前面,比较少见的在最后。
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
|
>>> a, b, c = 1, 2, 3>>> a, b, c(1, 2, 3)>>> a, b, c = [1, 2, 3]>>> a, b, c(1, 2, 3)>>> a, b, c = (2 * i + 1 for i in range(3))>>> a, b, c(1, 3, 5)>>> a, (b, c), d = [1, (2, 3), 4]>>> a1>>> b2>>> c3>>> d4 |
|
1
2
3
4
|
>>> a, b = 1, 2>>> a, b = b, a>>> a, b(2, 1) |
|
1
2
3
4
5
6
7
|
>>> a, *b, c = [1, 2, 3, 4, 5]>>> a1>>> b[2, 3, 4]>>> c5 |
|
1
2
3
4
5
|
>>> a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]>>> a[-1]10>>> a[-3]8 |
|
1
2
3
|
>>> a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]>>> a[2:8][2, 3, 4, 5, 6, 7] |
|
1
2
3
|
>>> a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]>>> a[-4:-2][7, 8] |
|
1
2
3
4
5
6
7
|
>>> a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]>>> a[::2][0, 2, 4, 6, 8, 10]>>> a[::3][0, 3, 6, 9]>>> a[2:8:2][2, 4, 6] |
|
1
2
3
4
5
|
>>> a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]>>> a[::-1][10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0]>>> a[::-2][10, 8, 6, 4, 2, 0] |
|
1
2
3
4
5
6
7
8
9
10
|
>>> a = [1, 2, 3, 4, 5]>>> a[2:3] = [0, 0]>>> a[1, 2, 0, 0, 4, 5]>>> a[1:1] = [8, 9]>>> a[1, 8, 9, 2, 0, 0, 4, 5]>>> a[1:-1] = []>>> a[1, 5] |
|
1
2
3
4
5
6
|
>>> a = [0, 1, 2, 3, 4, 5]>>> LASTTHREE = slice(-3, None)>>> LASTTHREEslice(-3, None, None)>>> a[LASTTHREE][3, 4, 5] |
|
1
2
3
4
5
6
7
|
>>> a = [1, 2, 3]>>> b = [‘a‘, ‘b‘, ‘c‘]>>> z = zip(a, b)>>> z[(1, ‘a‘), (2, ‘b‘), (3, ‘c‘)]>>> zip(*z)[(1, 2, 3), (‘a‘, ‘b‘, ‘c‘)] |
|
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
|
>>> a = [1, 2, 3, 4, 5, 6]>>> zip(*([iter(a)] * 2))[(1, 2), (3, 4), (5, 6)] >>> group_adjacent = lambda a, k: zip(*([iter(a)] * k))>>> group_adjacent(a, 3)[(1, 2, 3), (4, 5, 6)]>>> group_adjacent(a, 2)[(1, 2), (3, 4), (5, 6)]>>> group_adjacent(a, 1)[(1,), (2,), (3,), (4,), (5,), (6,)] >>> zip(a[::2], a[1::2])[(1, 2), (3, 4), (5, 6)] >>> zip(a[::3], a[1::3], a[2::3])[(1, 2, 3), (4, 5, 6)] >>> group_adjacent = lambda a, k: zip(*(a[i::k] for i in range(k)))>>> group_adjacent(a, 3)[(1, 2, 3), (4, 5, 6)]>>> group_adjacent(a, 2)[(1, 2), (3, 4), (5, 6)]>>> group_adjacent(a, 1)[(1,), (2,), (3,), (4,), (5,), (6,)] |
|
1
2
3
4
5
6
7
8
9
10
11
|
>>> def n_grams(a, n):... z = [iter(a[i:]) for i in range(n)]... return zip(*z)...>>> a = [1, 2, 3, 4, 5, 6]>>> n_grams(a, 3)[(1, 2, 3), (2, 3, 4), (3, 4, 5), (4, 5, 6)]>>> n_grams(a, 2)[(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)]>>> n_grams(a, 4)[(1, 2, 3, 4), (2, 3, 4, 5), (3, 4, 5, 6)] |
|
1
2
3
4
5
6
7
8
|
>>> m = {‘a‘: 1, ‘b‘: 2, ‘c‘: 3, ‘d‘: 4}>>> m.items()[(‘a‘, 1), (‘c‘, 3), (‘b‘, 2), (‘d‘, 4)]>>> zip(m.values(), m.keys())[(1, ‘a‘), (3, ‘c‘), (2, ‘b‘), (4, ‘d‘)]>>> mi = dict(zip(m.values(), m.keys()))>>> mi{1: ‘a‘, 2: ‘b‘, 3: ‘c‘, 4: ‘d‘} |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
|
>>> a = [[1, 2], [3, 4], [5, 6]]>>> list(itertools.chain.from_iterable(a))[1, 2, 3, 4, 5, 6] >>> sum(a, [])[1, 2, 3, 4, 5, 6] >>> [x for l in a for x in l][1, 2, 3, 4, 5, 6] >>> a = [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]>>> [x for l1 in a for l2 in l1 for x in l2][1, 2, 3, 4, 5, 6, 7, 8] >>> a = [1, 2, [3, 4], [[5, 6], [7, 8]]]>>> flatten = lambda x: [y for l in x for y in flatten(l)] if type(x) is list else [x]>>> flatten(a)[1, 2, 3, 4, 5, 6, 7, 8] |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
|
>>> g = (x ** 2 for x in xrange(10))>>> next(g)0>>> next(g)1>>> next(g)4>>> next(g)9>>> sum(x ** 3 for x in xrange(10))2025>>> sum(x ** 3 for x in xrange(10) if x % 3 == 1)408 |
|
1
2
3
4
5
6
7
|
>>> m = {x: x ** 2 for x in range(5)}>>> m{0: 0, 1: 1, 2: 4, 3: 9, 4: 16} >>> m = {x: ‘A‘ + str(x) for x in range(10)}>>> m{0: ‘A0‘, 1: ‘A1‘, 2: ‘A2‘, 3: ‘A3‘, 4: ‘A4‘, 5: ‘A5‘, 6: ‘A6‘, 7: ‘A7‘, 8: ‘A8‘, 9: ‘A9‘} |
|
1
2
3
4
5
|
>>> m = {‘a‘: 1, ‘b‘: 2, ‘c‘: 3, ‘d‘: 4}>>> m{‘d‘: 4, ‘a‘: 1, ‘b‘: 2, ‘c‘: 3}>>> {v: k for k, v in m.items()}{1: ‘a‘, 2: ‘b‘, 3: ‘c‘, 4: ‘d‘} |
|
1
2
3
4
5
6
7
8
|
>>> Point = collections.namedtuple(‘Point‘, [‘x‘, ‘y‘])>>> p = Point(x=1.0, y=2.0)>>> pPoint(x=1.0, y=2.0)>>> p.x1.0>>> p.y2.0 |
|
1
2
3
4
5
6
7
8
9
|
>>> class Point(collections.namedtuple(‘PointBase‘, [‘x‘, ‘y‘])):... __slots__ = ()... def __add__(self, other):... return Point(x=self.x + other.x, y=self.y + other.y)...>>> p = Point(x=1.0, y=2.0)>>> q = Point(x=2.0, y=3.0)>>> p + qPoint(x=3.0, y=5.0) |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
|
>>> A = {1, 2, 3, 3}>>> Aset([1, 2, 3])>>> B = {3, 4, 5, 6, 7}>>> Bset([3, 4, 5, 6, 7])>>> A | Bset([1, 2, 3, 4, 5, 6, 7])>>> A & Bset([3])>>> A - Bset([1, 2])>>> B - Aset([4, 5, 6, 7])>>> A ^ Bset([1, 2, 4, 5, 6, 7])>>> (A ^ B) == ((A - B) | (B - A))True |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
>>> A = collections.Counter([1, 2, 2])>>> B = collections.Counter([2, 2, 3])>>> ACounter({2: 2, 1: 1})>>> BCounter({2: 2, 3: 1})>>> A | BCounter({2: 2, 1: 1, 3: 1})>>> A & BCounter({2: 2})>>> A + BCounter({2: 4, 1: 1, 3: 1})>>> A - BCounter({1: 1})>>> B - ACounter({3: 1}) |
|
1
2
3
4
5
6
7
|
>>> A = collections.Counter([1, 1, 2, 2, 3, 3, 3, 3, 4, 5, 6, 7])>>> ACounter({3: 4, 1: 2, 2: 2, 4: 1, 5: 1, 6: 1, 7: 1})>>> A.most_common(1)[(3, 4)]>>> A.most_common(3)[(3, 4), (1, 2), (2, 2)] |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
|
>>> Q = collections.deque()>>> Q.append(1)>>> Q.appendleft(2)>>> Q.extend([3, 4])>>> Q.extendleft([5, 6])>>> Qdeque([6, 5, 2, 1, 3, 4])>>> Q.pop()4>>> Q.popleft()6>>> Qdeque([5, 2, 1, 3])>>> Q.rotate(3)>>> Qdeque([2, 1, 3, 5])>>> Q.rotate(-3)>>> Qdeque([5, 2, 1, 3]) |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
|
>>> last_three = collections.deque(maxlen=3)>>> for i in xrange(10):... last_three.append(i)... print ‘, ‘.join(str(x) for x in last_three)...00, 10, 1, 21, 2, 32, 3, 43, 4, 54, 5, 65, 6, 76, 7, 87, 8, 9 |
|
1
2
3
4
5
6
7
8
9
|
>>> m = dict((str(x), x) for x in range(10))>>> print ‘, ‘.join(m.keys())1, 0, 3, 2, 5, 4, 7, 6, 9, 8>>> m = collections.OrderedDict((str(x), x) for x in range(10))>>> print ‘, ‘.join(m.keys())0, 1, 2, 3, 4, 5, 6, 7, 8, 9>>> m = collections.OrderedDict((str(x), x) for x in range(10, 0, -1))>>> print ‘, ‘.join(m.keys())10, 9, 8, 7, 6, 5, 4, 3, 2, 1 |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
>>> m = dict()>>> m[‘a‘]Traceback (most recent call last): File "<stdin>", line 1, in <module>KeyError: ‘a‘>>>>>> m = collections.defaultdict(int)>>> m[‘a‘]0>>> m[‘b‘]0>>> m = collections.defaultdict(str)>>> m[‘a‘]‘‘>>> m[‘b‘] += ‘a‘>>> m[‘b‘]‘a‘>>> m = collections.defaultdict(lambda: ‘[default value]‘)>>> m[‘a‘]‘[default value]‘>>> m[‘b‘]‘[default value]‘ |
|
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
|
>>> import json>>> tree = lambda: collections.defaultdict(tree)>>> root = tree()>>> root[‘menu‘][‘id‘] = ‘file‘>>> root[‘menu‘][‘value‘] = ‘File‘>>> root[‘menu‘][‘menuitems‘][‘new‘][‘value‘] = ‘New‘>>> root[‘menu‘][‘menuitems‘][‘new‘][‘onclick‘] = ‘new();‘>>> root[‘menu‘][‘menuitems‘][‘open‘][‘value‘] = ‘Open‘>>> root[‘menu‘][‘menuitems‘][‘open‘][‘onclick‘] = ‘open();‘>>> root[‘menu‘][‘menuitems‘][‘close‘][‘value‘] = ‘Close‘>>> root[‘menu‘][‘menuitems‘][‘close‘][‘onclick‘] = ‘close();‘>>> print json.dumps(root, sort_keys=True, indent=4, separators=(‘,‘, ‘: ‘)){ "menu": { "id": "file", "menuitems": { "close": { "onclick": "close();", "value": "Close" }, "new": { "onclick": "new();", "value": "New" }, "open": { "onclick": "open();", "value": "Open" } }, "value": "File" }} |
|
1
2
3
4
5
6
7
8
9
10
11
12
|
>>> import itertools, collections>>> value_to_numeric_map = collections.defaultdict(itertools.count().next)>>> value_to_numeric_map[‘a‘]0>>> value_to_numeric_map[‘b‘]1>>> value_to_numeric_map[‘c‘]2>>> value_to_numeric_map[‘a‘]0>>> value_to_numeric_map[‘b‘]1 |
|
1
2
3
4
5
|
>>> a = [random.randint(0, 100) for __ in xrange(100)]>>> heapq.nsmallest(5, a)[3, 3, 5, 6, 8]>>> heapq.nlargest(5, a)[100, 100, 99, 98, 98] |
|
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
|
>>> for p in itertools.product([1, 2, 3], [4, 5]):(1, 4)(1, 5)(2, 4)(2, 5)(3, 4)(3, 5)>>> for p in itertools.product([0, 1], repeat=4):... print ‘‘.join(str(x) for x in p)...0000000100100011010001010110011110001001101010111100110111101111 |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
>>> for c in itertools.combinations([1, 2, 3, 4, 5], 3):... print ‘‘.join(str(x) for x in c)...123124125134135145234235245345>>> for c in itertools.combinations_with_replacement([1, 2, 3], 2):... print ‘‘.join(str(x) for x in c)...111213222333 |
|
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
|
>>> for p in itertools.permutations([1, 2, 3, 4]):... print ‘‘.join(str(x) for x in p)...123412431324134214231432213421432314234124132431312431423214324134123421412341324213423143124321 |
|
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
|
>>> a = [1, 2, 3, 4]>>> for p in itertools.chain(itertools.combinations(a, 2), itertools.combinations(a, 3)):... print p...(1, 2)(1, 3)(1, 4)(2, 3)(2, 4)(3, 4)(1, 2, 3)(1, 2, 4)(1, 3, 4)(2, 3, 4)>>> for subset in itertools.chain.from_iterable(itertools.combinations(a, n) for n in range(len(a) + 1))... print subset...()(1,)(2,)(3,)(4,)(1, 2)(1, 3)(1, 4)(2, 3)(2, 4)(3, 4)(1, 2, 3)(1, 2, 4)(1, 3, 4)(2, 3, 4)(1, 2, 3, 4) |
|
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
|
>>> import itertools>>> with open(‘contactlenses.csv‘, ‘r‘) as infile:... data = [line.strip().split(‘,‘) for line in infile]...>>> data = data[1:]>>> def print_data(rows):... print ‘\n‘.join(‘\t‘.join(‘{: <16}‘.format(s) for s in row) for row in rows)... >>> print_data(data)young myope no reduced noneyoung myope no normal softyoung myope yes reduced noneyoung myope yes normal hardyoung hypermetrope no reduced noneyoung hypermetrope no normal softyoung hypermetrope yes reduced noneyoung hypermetrope yes normal hardpre-presbyopic myope no reduced nonepre-presbyopic myope no normal softpre-presbyopic myope yes reduced nonepre-presbyopic myope yes normal hardpre-presbyopic hypermetrope no reduced nonepre-presbyopic hypermetrope no normal softpre-presbyopic hypermetrope yes reduced nonepre-presbyopic hypermetrope yes normal nonepresbyopic myope no reduced nonepresbyopic myope no normal nonepresbyopic myope yes reduced nonepresbyopic myope yes normal hardpresbyopic hypermetrope no reduced nonepresbyopic hypermetrope no normal softpresbyopic hypermetrope yes reduced nonepresbyopic hypermetrope yes normal none >>> data.sort(key=lambda r: r[-1])>>> for value, group in itertools.groupby(data, lambda r: r[-1]):... print ‘-----------‘... print ‘Group: ‘ + value... print_data(group)...-----------Group: hardyoung myope yes normal hardyoung hypermetrope yes normal hardpre-presbyopic myope yes normal hardpresbyopic myope yes normal hard-----------Group: noneyoung myope no reduced noneyoung myope yes reduced noneyoung hypermetrope no reduced noneyoung hypermetrope yes reduced nonepre-presbyopic myope no reduced nonepre-presbyopic myope yes reduced nonepre-presbyopic hypermetrope no reduced nonepre-presbyopic hypermetrope yes reduced nonepre-presbyopic hypermetrope yes normal nonepresbyopic myope no reduced nonepresbyopic myope no normal nonepresbyopic myope yes reduced nonepresbyopic hypermetrope no reduced nonepresbyopic hypermetrope yes reduced nonepresbyopic hypermetrope yes normal none-----------Group: softyoung myope no normal softyoung hypermetrope no normal softpre-presbyopic myope no normal softpre-presbyopic hypermetrope no normal softpresbyopic hypermetrope no normal |
[1] Python的优雅技巧
http://segmentfault.com/a/1190000002869103
[2] stackoverflow-py-top-qa
https://github.com/wklken/stackoverflow-py-top-qa/blob/master/contents/qa-string.md
标签:
原文地址:http://www.cnblogs.com/geekpy/p/5131635.html