栈是一种基础的数据结构，它遵循“先进后出”（Last In First Out, LIFO）的原则。下面是一个简单的栈数据结构的算法设计，使用Python语言为例： ```python class Stack: def __init__(self): self.items = [] # 入栈（push） def push(self, item): self.items.append(item) # 出栈（pop） def pop(self): if not self.is_empty(): return self.items.pop() else: return None # 检查栈是否为空 def is_empty(self): return len(self.items) == 0 # 查看栈顶元素，但不移除 def peek(self): if not self.is_empty(): return self.items[-1] # 应用场景示例 def calculate_expression(expression): stack = Stack() operators = ['+', '-', '*', '/'] for char in expression: if char.isdigit(): stack.push(int(char)) elif char in operators: num2 = stack.pop() num1 = stack.pop() result = perform_operation(num1, num2, char) stack.push(result) return stack.pop() def perform_operation(num1, num2, operator): if operator == '+': return num1 + num2 elif operator == '-': return num1 - num2 elif operator == '*': return num1 * num2 elif operator == '/': if num2 != 0: return num1 / num2 else: raise ValueError("Division by zero") expression = "5*2+3" result = calculate_expression(expression) print(f"Result of expression {expression} is {result}")