更新递归实现阶乘

zhanghe06 · zhanghe06 · commit 7a62f8ebbe6a · 2017-08-31T14:36:43.000+08:00
diff --git a/test/algorithm/recursion.py b/test/algorithm/recursion.py
@@ -33,9 +33,17 @@ def factorial(n):
 node_list = []
 
 
-def pop_list(nodes=None, parent=None, node_list=None):
+def pop_list(nodes, parent=None, node_list=None):
+    """
+    递归父子关系
+    :param nodes:
+    :param parent:
+    :param node_list:
+    :return:
+    """
     if parent is None:
         return node_list
+    next_parent = None
     node_list.append([])
     for node in nodes:
         if node['parent'] == parent:
