棧（Stack）是一種運(yùn)算受限的線性表。
按照先進(jìn)后出(FILO，F(xiàn)irst In Last Out)的原則存儲(chǔ)數(shù)據(jù)，先進(jìn)入的數(shù)據(jù)被壓入棧底，最后的數(shù)據(jù)在棧頂。棧只能在一端進(jìn)行插入和刪除操作。
文章內(nèi)容包含：
（1）棧的基本格式
（2）壓棧 push_stack
（3）出棧 pop_stack
（4）取棧頂 peek_stack
class Stack():
def __init__ (self,size):
self.size = size #棧空間大小
self.top = -1 #棧中進(jìn)入一個(gè)數(shù)據(jù) top 加 1
self.stack = []
def display_stack(self):#棧stack的打印
print(self.stack)
if __name__ == "__main__":
stack = Stack(5) #設(shè)定?？臻g
stack.display_stack() #打印棧數(shù)據(jù)
class Stack():
def __init__ (self,size):
self.size = size
self.top = -1
self.stack = [] #進(jìn)棧數(shù)據(jù)列表
def display_stack(self):
print(self.stack)
def push_stack(self,data):
if len(self.stack ) >= self.size: #當(dāng)數(shù)據(jù)數(shù)量大于設(shè)置的空間，則棧溢出
print("stack over flow!")
return
self.stack.append(data) #沒(méi)有棧溢出就將數(shù)據(jù)追加到列表中
self.top += 1 #棧中每增加一個(gè)數(shù)據(jù)就加 1
if __name__ == "__main__":
stack = Stack(5)
stack.push_stack(0)
stack.push_stack(1)
stack.push_stack(2)
stack.push_stack(3)
stack.push_stack(4)
stack.push_stack(5) #stack空間是 5，這里進(jìn)棧數(shù)據(jù)時(shí) 6 個(gè)，即提示棧溢出stack over flow！
stack.display_stack()
執(zhí)行結(jié)果：
class Stack():
def __init__ (self,size):
self.size = size
self.top = -1
self.stack = [] #進(jìn)棧數(shù)據(jù)列表
def display_stack(self):
print(self.stack)
def push_stack(self,data):
if len(self.stack ) >= self.size:
print("stack over flow!")
return
self.stack.append(data)
self.top += 1
def pop_stack(self):
if self.top = -1: #當(dāng)top小于等于初始值 -1 時(shí)說(shuō)明stack數(shù)據(jù)列表為空
print("stack is empty!")
return
ret = self.stack.pop() #stack數(shù)據(jù)列表不為空就取出最后進(jìn)的值，列表數(shù)據(jù)數(shù)量就少一個(gè)
self.top -= 1
return ret
if __name__ == "__main__":
stack = Stack(5)
stack.push_stack(0)
stack.push_stack(1)
stack.push_stack(2)
stack.push_stack(3)
stack.push_stack(4)
stack.display_stack()
#進(jìn)棧數(shù)據(jù)有 5 個(gè)，出棧函數(shù)調(diào)用了 6 次，就出現(xiàn)了提示stack is empty!
ret = stack.pop_stack()
print(ret)
stack.display_stack()
ret = stack.pop_stack()
print(ret)
stack.display_stack()
ret = stack.pop_stack()
print(ret)
stack.display_stack()
ret = stack.pop_stack()
print(ret)
stack.display_stack()
ret = stack.pop_stack()
print(ret)
stack.display_stack()
ret = stack.pop_stack()
print(ret)
stack.display_stack()
執(zhí)行結(jié)果：
class Stack():
def __init__ (self,size):
self.size = size
self.top = -1
self.stack = []
def display_stack(self):
print(self.stack)
def push_stack(self,data):
if len(self.stack ) >= self.size:
print("stack over flow!")
return
self.stack.append(data)
self.top += 1
def peek_stack(self):
if self.top == -1: #當(dāng)棧內(nèi)沒(méi)有數(shù)據(jù)時(shí) 提示 stack is empty!
print("stack is empty!")
return
peek = self.stack[self.top] #棧不為空時(shí)，將棧頂?shù)臄?shù)據(jù)提取出來(lái)
return peek
if __name__ == "__main__":
stack = Stack(5)
stack.push_stack(0)
stack.push_stack(1)
stack.push_stack(2)
stack.push_stack(3)
stack.push_stack(4)
stack.push_stack(5)
stack.display_stack()
peek = stack.peek_stack()
print(peek)
執(zhí)行結(jié)果：
到此這篇關(guān)于詳解python數(shù)據(jù)結(jié)構(gòu)之棧stack的文章就介紹到這了,更多相關(guān)python 棧stack內(nèi)容請(qǐng)搜索腳本之家以前的文章或繼續(xù)瀏覽下面的相關(guān)文章希望大家以后多多支持腳本之家！
標(biāo)簽：黑龍江 上海 益陽(yáng) 惠州 黔西 鷹潭 常德 四川
巨人網(wǎng)絡(luò)通訊聲明：本文標(biāo)題《詳解python數(shù)據(jù)結(jié)構(gòu)之棧stack》，本文關(guān)鍵詞 詳解,python,數(shù)據(jù)結(jié)構(gòu),之棧,；如發(fā)現(xiàn)本文內(nèi)容存在版權(quán)問(wèn)題，煩請(qǐng)?zhí)峁┫嚓P(guān)信息告之我們，我們將及時(shí)溝通與處理。本站內(nèi)容系統(tǒng)采集于網(wǎng)絡(luò)，涉及言論、版權(quán)與本站無(wú)關(guān)。
