flatten·deeply·nested·数组·core·interview·pattern 模式
1 道题目
模式页适合用来建立可复用解题框架。先识别题目特征，再按固定流程解释状态定义、转移和边界。
识别信号
- Look for candidates who can implement recursion or iteration effectively to manage the depth of nested arrays.
- Candidates should demonstrate an understanding of managing both space and time complexity when flattening arrays.
解题流程
- 1. 明确窗口/状态定义
- 2. 更新状态并维护约束
- 3. 用边界样例验证
常见失分点
- Overusing recursion can lead to excessive stack usage, especially when dealing with large arrays and deep nesting.