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
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
分割
David Liu
12/12/25
Less than 1 minute
分割
划分成k个部分,等价于:先划分成1一个部分,再划分k-1个部分
本质上来说还是枚举了k-1个断点,还是组合问题,写法也一致。
(这样一步一步拆分可以dfs,参考石子合并的最小代价lc1000)
Prev
组合
Next
选择