分而治之——D&C策略

D&C策略 <Divide & conquer>

递归
1.Base Case 基线条件 => Return
2.RecursiveCase 递归条件 => go on

D&C步骤
1.Find a BaseCase
2.Separate handle with question
3.if[BaseCase] Return

EG:Sum=> Array[1,3,5,7,9]
BaseCase:Sum(Array[]) = 0 < null Array >

标签：Case,Return,策略,递归,Sum,分而治之,BaseCase,Array
来源： https://www.cnblogs.com/liflower/p/15339584.html