Skip to main content
David's Blog
About
Algorithm
Framework
Data Structure
Linear
Tree
Graph
Set
Search
DFS
BFS
FOR
Optimization
Decrease & Conquer
Dynamic Programming
Math
FAQ
AI
Recommender System
Retrieval
Pre-Ranking
Ranking
Re-Ranking
Metrics
Generative Models
Computer Science
Core
Network
Operating System
Design
Design Pattern
Object-Oriented Design
System Design
Engineering
Database
MySQL
Redis
Lang
Java
DevOps
Unix
Tools
Tests
TOEFL
LISTENING
READING
SPEAKING
WRITING
GRE
QUANTITATIVE
VERBAL
DFS
David Liu
4/3/26
Less than 1 minute
DFS
dfs时间复杂度分析:
通用:O(方案总数*构造每个方案的时间)
程序结构的艺术
入口函数
搜索函数
判断函数
打印函数
DFS优化策略
可行性剪枝
最优性剪枝
顺序性优化
优先搜索那些可能方案少的位置