栈的python代码
This commit is contained in:
parent
f8d44be73d
commit
60cb2ffc97
@ -21,7 +21,7 @@ class ArrayStack:
|
|||||||
return self._size
|
return self._size
|
||||||
|
|
||||||
""" 判断栈是否为空 """
|
""" 判断栈是否为空 """
|
||||||
def isEmpty(self):
|
def is_empty(self):
|
||||||
return self._stack == []
|
return self._stack == []
|
||||||
|
|
||||||
""" 入栈 """
|
""" 入栈 """
|
||||||
@ -70,4 +70,4 @@ if __name__ == "__main__":
|
|||||||
print("栈的长度 size = ", size)
|
print("栈的长度 size = ", size)
|
||||||
|
|
||||||
""" 判断是否为空 """
|
""" 判断是否为空 """
|
||||||
isEmpty = (stack == [])
|
isEmpty = stack.is_empty()
|
||||||
|
@ -50,8 +50,9 @@ class LinkedListStack:
|
|||||||
stack = []
|
stack = []
|
||||||
temp = self.head
|
temp = self.head
|
||||||
while temp:
|
while temp:
|
||||||
stack.insert(0, temp.val)
|
stack.append(temp.val)
|
||||||
temp = temp.next
|
temp = temp.next
|
||||||
|
stack = stack[::-1]
|
||||||
return stack
|
return stack
|
||||||
|
|
||||||
|
|
||||||
@ -81,4 +82,4 @@ if __name__ == "__main__":
|
|||||||
print("栈的长度 size = ", size)
|
print("栈的长度 size = ", size)
|
||||||
|
|
||||||
""" 判断是否为空 """
|
""" 判断是否为空 """
|
||||||
isEmpty = (stack == [])
|
isEmpty = stack.is_empty()
|
||||||
|
Loading…
Reference in New Issue
Block a user