# 使用List作為棧stack = [3, 4, 5]# 入棧stack.append(6)# 出棧val = stack.pop()# 棧定元素val = stack[-1]隊(duì)列

隊(duì)列是FIFO, 但是List對(duì)于First Out效率不夠高。通常用雙端隊(duì)列Deque來實(shí)現(xiàn)隊(duì)列

Deque的特點(diǎn)是，兩端添加和刪除都是O(1)的時(shí)間復(fù)雜度

from collections import dequequeue = deque(['Eric', 'John', 'Michael'])# 入隊(duì)列queue.append('Terry')# 出隊(duì)列queue.popleft()元組

與List非常相似，但是Tuple是不可變的數(shù)據(jù)結(jié)構(gòu)

# 創(chuàng)建, 等號(hào)右邊可以用括號(hào)擴(kuò)起來empty = ()xyz = 12345, 54321, ’hello!’one = 12345,## Unpackingx, y, z = xyzx, = one

Tuple內(nèi)部是可以有List這樣可變的元素的

a = [1,2,3]b = [4,5,6]# 創(chuàng)建, 等號(hào)右邊可以用括號(hào)擴(kuò)起來t = (a, b) # ([1, 2, 3], [4, 5, 6])a.append(4)b.append(7)print(t)# ([1, 2, 3, 4], [4, 5, 6, 7])

如果Tuple足夠滿足，那么Tuple由以下兩個(gè)優(yōu)勢:

import syst = tuple(range(2 ** 24))l = [i for i in range(2 ** 24)]# 比較內(nèi)存使用print(sys.getsizeof(t), sys.getsizeof(l))

Tuple創(chuàng)建方式

import timeit# 從Range轉(zhuǎn)換Tuple 這種速度最快，推薦此方法timeit.timeit(’’’t = tuple(range(10000))’’’, number = 10000)# 從List創(chuàng)建Tupletimeit.timeit(’’’t = tuple([i for i in range(10000)])’’’, number = 10000)# 從Range創(chuàng)建Tupletimeit.timeit(’’’t = tuple(i for i in range(10000))’’’, number = 10000)# Unpacking生成器創(chuàng)建Tupletimeit.timeit(’’’t = *(i for i in range(10000)),’’’, number = 10000)Range

序列數(shù)據(jù)結(jié)構(gòu)(List, Tuple, Range)的一種, 常與For循環(huán)一起使用

# 0 - 9val = range(10)val = range(0, 10)val = range(0, 10, 1)集合

empty = set()a = {1, 2, 3, 3, 3, 2}b = {1, 3, 5, 7, 9}# 超集和子集a <= ba.issubset(b)b.issuperset(a)# 交集intersection = a & b# 并集union = a | b# 差subtraction = a - b# 對(duì)稱差symmetric_difference = a ^ b字典

字典由(Key: Value)對(duì)組成，對(duì)于Key的要求是不可變類型(String, Number等)，

所以Tuple可以作為Key，但是List卻不行。

# {’sape’: 4139, ’guido’: 4127, ’jack’: 4098}d = dict([(’sape’, 4139), (’guido’, 4127), (’jack’, 4098)])# {2: 4, 4: 16, 6: 36}d = {x: x**2 for x in (2, 4, 6)}# {’sape’: 4139, ’guido’: 4127, ’jack’: 4098}d = dict(sape=4139, guido=4127, jack=4098)

但是如果Tuple內(nèi)包含可變類型，那么也不能作為Key, 會(huì)出現(xiàn)如下錯(cuò)誤:

TypeError: unhashable type: ’list’生成式

生成式(List Comprehensions)提供一種簡潔的方式創(chuàng)建列表

# [0, 1, 4, 9, 16, 25, 36, 49, 64, 81]# 創(chuàng)建列表squares = []for x in range(10): squares.append(x**2)# 生成式squares = [x**2 for x in range(10)]條件語句

# [(1, 3), (1, 4), (2, 3), (2, 1), (2, 4), (3, 1), (3, 4)][(x, y) for x in [1,2,3] for y in [3,1,4] if x != y]使用函數(shù)

# [’3.1’, ’3.14’, ’3.142’, ’3.1416’, ’3.14159’]from math import pi[str(round(pi, i)) for i in range(1, 6)]生成式嵌套

matrix = [ [1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12],]# 行列matrix = [[row[i] for i in range(len(row))] for row in matrix]# 列行transposed = [[row[i] for row in matrix] for i in range(4)]transposed = list(zip(*matrix))生成器

生成器與生成式語法相似，只是生成器是懶加載模式，不會(huì)立即生成整個(gè)列表

import sys# 元素已經(jīng)就緒，耗費(fèi)較多的內(nèi)存l = [i for i in range(2 ** 24)] print(sys.getsizeof(l)) # 146916504 // 8 = 2 ** 24 # 創(chuàng)建生成器對(duì)象, 不占用額外空間，但是需要數(shù)據(jù)的時(shí)候需要內(nèi)部運(yùn)算l = (i for i in range(2 ** 24)) print(sys.getsizeof(l)) # 128

除了上面的生成器語法，還有一種就是通過yield關(guān)鍵字

def fib(n): a, b = 0, 1 for _ in range(n): a, b = b, a + b yield aif __name__ == ’__main__’: for val in fib(20): print(val)循環(huán)列表循環(huán)

l = [’tic’, ’tac’, ’toe’]for index in range(len(l)) print(index, l[index])for val in l: print(val)for index, val in enumerate(l): print(index, val)字典循環(huán)

d = {’gallahad’: ’the pure’, ’robin’: ’the brave’}for key in d: print(key, d[key])for key, val in d.items(): print(key, val)reversed

# [0, 2, 4, 6, 8]for num in range(0, 10, 2): print(num)# [8, 6, 4, 2, 0]for num in reversed(range(0, 10, 2)): print(num)zip

返回Tuple的迭代器, 第i個(gè)元素來自于參數(shù)中每一個(gè)第i個(gè)元素, 長度等于最短的那個(gè)參數(shù)

以上就是python中常用的數(shù)據(jù)結(jié)構(gòu)介紹的詳細(xì)內(nèi)容，更多關(guān)于python 數(shù)據(jù)結(jié)構(gòu)的資料請(qǐng)關(guān)注好吧啦網(wǎng)其它相關(guān)文章！