Data Structures in Python -Stack

The stack in Python, like other programming languages, is a linear data structure that follows the last-in-first-out (LIFO) principle. This means that the last element added will be removed first.

Stack scene understanding:

Imagine a stack of plates and you can only add or remove the top plate. Common operations include "push" (adding an element), "pop" (removing the top element), and "peek" (viewing the top element without removing it).

Common operations of stack:

Common operations of the stack are as follows:

• Push: Add an element to the top of the stack.
• Pop: Remove and return the top element of the stack.
• Peek: Return the top element of the stack without removing it.
• is_empty: Check whether the stack is empty.
• size: Returns the number of elements in the stack.

How to create a stack:

To create a stack in Python, we can use different methods according to our needs. Here's how to create and use stacks using different methods:

Usage list:

Lists in Python can act as stacks because they support append() for adding elements and pop() for removing the last element.

<code class="language-python"># 使用列表实现栈
stack = []

# 向栈中压入元素
stack.append(1)
stack.append(2)
stack.append(3)

print("压入元素后的栈：", stack)

# 从栈中弹出元素
popped_element = stack.pop()
print("弹出的元素：", popped_element)
print("弹出后的栈：", stack)

# 查看栈顶元素
if stack:
    print("栈顶元素：", stack[-1])
else:
    print("栈为空。")</code>

https://www.php.cn/link/6003950cffdc86970909a494861920c6

The above is the detailed content of Data Structures in Python -Stack. For more information, please follow other related articles on the PHP Chinese website!