--------------- offer签了,请教关于贷款的几个问题# Living
o*s
1 楼
You are given a binary tree in which each node contains a value. Design an
algorithm
to print all paths which sum up to that value. Note that it can be any path
in the tree
- it does not have to start at the root.
这道题的答案有问题吧,没有考虑到过某个节点再回来的情况,比如
5
/
3 7
比如target=15,给出的答案找不到3,5,7这条path啊
还是我理解有问题?谢谢
algorithm
to print all paths which sum up to that value. Note that it can be any path
in the tree
- it does not have to start at the root.
这道题的答案有问题吧,没有考虑到过某个节点再回来的情况,比如
5
/
3 7
比如target=15,给出的答案找不到3,5,7这条path啊
还是我理解有问题?谢谢