第2章 Python序列.ppt

2.5 再谈内置方法sorted() gameresult = [[Bob, 95.0, A], [Alan, 86.0, C], [Mandy, 83.5, A], [Rob, 89.3, E]] sorted(gameresult, key=itemgetter(0, 1)) #按姓名升序，姓名相同按分数升序排序 [[Alan, 86.0, C], [Bob, 95.0, A], [Mandy, 83.5, A], [Rob, 89.3, E]] sorted(gameresult, key=itemgetter(1, 0)) #按分数升序，分数相同的按姓名升序排序 [[Mandy, 83.5, A], [Alan, 86.0, C], [Rob, 89.3, E], [Bob, 95.0, A]] sorted(gameresult, key=itemgetter(2, 0)) #按等级升序，等级相同的按姓名升序排序 [[Bob, 95.0, A], [Mandy, 83.5, A], [Alan, 86.0, C], [Rob, 89.3, E]] 2.5 再谈内置方法sorted() gameresult = [{name:Bob, wins:10, losses:3, rating:75.0}, {name:David, wins:3, losses:5, rating:57.0}, {name:Carol, wins:4, losses:5, rating:57.0}, {name:Patty, wins:9, losses:3, rating:72.8}] sorted(gameresult, key=itemgetter(wins, name)) #按’wins’升序，该值相同的按’name’升序排序 [{wins: 3, rating: 57.0, name: David, losses: 5}, {wins: 4, rating: 57.0, name: Carol, losses: 5}, {wins: 9, rating: 72.8, name: Patty, losses: 3}, {wins: 10, rating: 75.0, name: Bob, losses: 3}] 2.5 再谈内置方法sorted() 以下代码演示如何根据另外一个列表的值来对当前列表元素进行排序 list1 = [what, Im, sorting, by] list2 = [something, else, to, sort] pairs = zip(list1, list2) pairs = sorted(pairs) pairs [(Im, else), (by, sort), (sorting, to), (what, something)] result = [x[1] for x in pairs] result [else, sort, to, something] 2.6 其他数据结构 在Python中，除了基本序列之外，还有其他一些常用的数据结构，如堆、栈、队列、树、图等等。 有些结构Python已经提供，而有些则需要自己利用基本数据结构来实现。 2.6.1 堆 import heapq import random data=range(10) data [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] random.choice(data) 9 random.choice(data) 1 random.choice(data) random.shuffle(data) data [6, 1, 3, 4, 9, 0, 5, 2, 8, 7] heap=[] for n in data: heapq.heappush(heap,n) heap [0, 2, 1, 4, 7, 3, 5, 6, 8, 9] 2.6.1 堆 heapq.heappush(heap,0.5) heap [0, 0.5, 1, 4, 2, 3, 5, 6, 8, 9, 7] heapq.heappop(heap) 0 heapq.heappop(heap) 0.5 heapq.heappop(heap) 1 myheap=[1,2,3,5,7,8,9,4,10,333] heapq.heapify(myheap) myheap [1, 2, 3, 4, 7, 8, 9, 5, 10, 333] heapq.heapreplace(myheap,6) 1 myhea