Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Ea…
标签：DFS
DFS（深度优先遍历）----最短路径
指导网址：https://blog.csdn.net/autfish/article/details/52447805 遇到纸条传递问题，刚开始觉得—我去，这不是就丫走两遍DFS的事儿么，后来才发现，会有堵死…
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Ea…
指导网址：https://blog.csdn.net/autfish/article/details/52447805 遇到纸条传递问题，刚开始觉得—我去，这不是就丫走两遍DFS的事儿么，后来才发现，会有堵死…