Skip to main content
David Liu
Home
Algorithms
Overview
Data Structures
Linear
Tree
Graph
Set
Search
DFS
BFS
FOR
Optimization
Decrease & Conquer
Dynamic Programming
Math
Study Tracks
JZ Track
Problem-Solving Framework
FAQ
AI Systems
Overview
Foundations
Overview
Classical ML
Deep Learning
Language Models
Reinforcement Learning
Generative AI
Overview
Large Language Models
Foundation Model Training
Alignment
Inference
Multimodal
RAG
Agents
AI Engineering
Recommender Systems
Retrieval
Pre-Ranking
Ranking
Re-Ranking
Metrics
Cold Start
PyTorch
Search Systems
AI Evaluation
AI Safety
CS Foundations
Overview
Systems Foundations
Computer Networks
Operating Systems
Software & System Design
Object-Oriented Design
Design Patterns
System Design
Software Engineering
Overview
Languages & Runtimes
Overview
Java
Python
Go
C++
Data Systems
Overview
MySQL
Redis
MongoDB
SQL
Middleware
Overview
Kafka
RabbitMQ
Elasticsearch
Nginx
DevOps & Infrastructure
Overview
Unix
Docker
Kubernetes
CI/CD
Application Engineering
Quality & Tooling
Observability
Software Testing
Engineering Tools
Test Prep
Overview
TOEFL iBT
Overview
Reading
Listening
Speaking
Writing
GRE General Test
Overview
Verbal
Quantitative
Analytical Writing
Language Foundations
Search
Ctrl
K
减治
Less than 1 minute
About 94 words
减治
减治的核心不是“每次减一点”,而是
你能稳定排除一整块不可能成为答案的状态
。
典型信号
有序数组或广义单调结构
二值性 / 两段性
双指针能避免回头
排序后可以持续删除无效状态
Canonical Docs
Decrease & Conquer
Binary
2 Pointers
Greedy
Prev
Optimization Decision Guide
Next
动态规划