栈的python代码

codes/python/chapter_stack_and_queue/array_stack.py

@@ -21,7 +21,7 @@ class ArrayStack:
         return self._size
 
     """ 判断栈是否为空 """
-    def isEmpty(self):
+    def is_empty(self):
         return self._stack == []
 
     """ 入栈 """
@@ -70,4 +70,4 @@ if __name__ == "__main__":
     print("栈的长度 size = ", size)
 
     """ 判断是否为空 """
-    isEmpty = (stack == [])
+    isEmpty = stack.is_empty()

codes/python/chapter_stack_and_queue/linkedlist_stack.py

@@ -50,8 +50,9 @@ class LinkedListStack:
         stack = []
         temp = self.head
         while temp:
-            stack.insert(0, temp.val)
+            stack.append(temp.val)
             temp = temp.next
+        stack = stack[::-1]
         return stack
 
 
@@ -81,4 +82,4 @@ if __name__ == "__main__":
     print("栈的长度 size = ", size)
 
     """ 判断是否为空 """
-    isEmpty = (stack == [])
+    isEmpty = stack.is_empty()