深度学习学习路线

数据结构和算法经典100题-第4题

bobkentblog: [code=python] def findpath(root, nodes, sum): if root is None: return (root) if is None and is None: if sum == : for node in nodes: print() else: if is not None: findpath(, nodes, sum - ) if is not None: findpath(, nodes, sum - ) () [/code]