就是多叉树的遍历,用了个辅助栈,DFS
import os, json
file_root = 'xxx'
stack = [file_root]
file_list = []
while len(stack) != 0:
node = stack.pop()
for sub_node in os.listdir(node):
sub_node = node + '/' + sub_node
if not os.path.isfile(sub_node):
stack.append(sub_node)
else:
file_list.append(sub_node)