Given a binary tree, find the maximum path sum# JobHunting - 待字闺中
y*0
1 楼
/**
Given a binary tree, find the maximum path sum.
The path may start and end at any node in the tree.
For example:
Given the below binary tree,
1
/ \
2 3
Return 6.
**/
OJ上面的题目。
给的例子，为啥是结果6，而不是4？ 不是说path吗？
Given a binary tree, find the maximum path sum.
The path may start and end at any node in the tree.
For example:
Given the below binary tree,
1
/ \
2 3
Return 6.
**/
OJ上面的题目。
给的例子，为啥是结果6，而不是4？ 不是说path吗？
