2014年11月29日
[LeetCode] Path Sum II
摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文
posted @ 2014-11-29 11:45 vincently 阅读(188) 评论(0) 推荐(0) 编辑
[LeetCode] PathSum
摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo... 阅读全文
posted @ 2014-11-29 10:53 vincently 阅读(170) 评论(0) 推荐(0) 编辑