* 时间复杂度: O(n+k) k=max-min+1 空间复杂度: O(k) 稳定: ✓
Carry propagation — threading carry information across positions
，更多细节参见旺商聊官方下载
Author(s): Shin-Pon Ju, Dong-Yeh Wu, Chun-Wen Cheng, Hsing-Yin Chen，推荐阅读safew官方下载获取更多信息
Think about how you'd search a large room for a lost key. You wouldn't examine every square inch sequentially. You'd split the room into sections (by the couch, near the door, under the table) and rule out entire sections at a glance. "I didn't go near the kitchen, so skip that."，更多细节参见雷电模拟器官方版本下载