Skip to main content
David Liu
/
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
Text & Pre-Training
Training Systems
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 System
Software & System Design
Design Pattern
Object-Oriented Design
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
Delivery & Operations
Overview
Unix
Docker
Kubernetes
CI/CD
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
Archive
Course Notes
Personal Notes
All Articles
Tags
分割
David Liu
8/3/26
Less than 1 minute
分割
划分成k个部分,等价于:先划分成1一个部分,再划分k-1个部分
本质上来说还是枚举了k-1个断点,还是组合问题,写法也一致。
(这样一步一步拆分可以dfs,参考石子合并的最小代价lc1000)
Prev
Combination DFS
Next
选择