class LNode(object):def __init__(self,elem,next=None):self.elem = elemself.next = nextclass LStack(LNode):def __init__(self):self._top = Nonedef is_empty(self):return self._top is None#打印棧頂元素def top(self):#頭指針空,即沒有元素if self._top is None:print("in LStack.top()")#否則返回第一個(gè)元素return self._top.elemdef push(self,elem):self._top = LNode(elem,self._top)def pop(self):if self._top is None:print("in LStack.pop()")p = self._topself._top = p.nextreturn p.elemstack = LStack() list1 = ['a','b','c','d','e'] list2 = [] # for i in list1: # stack.push(i) while not stack.is_empty():list2.append(stack.pop()) print("進(jìn)棧前順序:",list1) print("出棧后順序:",list2) # print(stack.top())

輸出結(jié)果

進(jìn)棧前順序: ['a', 'b', 'c', 'd', 'e'] 出棧后順序: ['e', 'd', 'c', 'b', 'a']

總結(jié)

以上是生活随笔為你收集整理的Python-栈的链式表实现(没写清楚)的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。