leetcode-泛型递归

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
let res = []
recursion(level,param1,param2)
return res

function recursion(level, param1, param2){
	// 1. terminator 终止条件
  if(level > max_level){
    process_result
    return
  }
  
  // 2. process logic in current level 处理当前层逻辑
  process(level,data)
  
  // 3. dirll down 进入下一层
  recursion(level+1,param1,param2)
  
  // 4. reverse the current level status if needed 清理当前层状态
}