Skip to main content
David's Blog
About
Algorithm
Overview
Data Structure
Linear
Tree
Graph
Set
Search
DFS
BFS
FOR
Optimization
Decrease & Conquer
Dynamic Programming
Math
Course
JZ Track
Framework
FAQ
AI
Overview
Foundation
Recommender System
Retrieval
Pre-Ranking
Ranking
Re-Ranking
Metrics
Cold Start
Generative Models
Overview
Fine-Tuning
Alignment
Inference
Multimodal
Application
PyTorch
Search
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
FOR
David Liu
5/10/26
Less than 1 minute
FOR
FOR 适合固定层数、固定维度的枚举问题。它不是“比 DFS 更低级”,而是状态空间本来就是线性的或有限层的。
When FOR Is the Right Lens
枚举区间、起点终点、固定下标组合
问题天然是 1 到 3 层循环,不需要递归树
主要状态在数组、字符串或固定维度结构上
Canonical Docs
FOR Overview
Search Overview
Prev
DFS