1. 程式人生 > >python3 cookbook 學習筆記-資料結構和演算法(未完待續)

python3 cookbook 學習筆記-資料結構和演算法(未完待續)

資料結構和演算法

  1. 將序列分解成單獨的變數
can_iter_list = [1,2,3,4,5]
can_iter_str = "hansz"

can_iter = can_iter_str
a,b,c,d,e = can_iter
a,_,b,_,c = can_iter
# 只要是可迭代的物件都可以分解,包括生成器和迭代器等
  1. 從任意長度的可迭代物件中分解元素
can_iter_list = [1,2,3,4,5]
can_iter_str = "hansz"

can_iter = can_iter_str
a,*b = can_iter

record = ("acme"
,50,11,22,(12,11,2012)) name,*_,(*_,year) = record
  1. 儲存最後N個元素
from collections import deque
my_deque = deque(maxlen=5)
my_deque.append(1)
# my_deque 最多隻能儲存5個元素
  1. 找到最大或最小的N各元素

import heapq

a = [1,4,5,542,342,423,1,653,4]
heapq.nlargest(3,a)
heapq.nsmallest(4,a)