2013年8月10日
leetcode -- Path Sum
摘要： 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.For example:Given the below binary tree andsum = 22, 5 / \ 4 8 / / \ 11 13 4 / \ ... 阅读全文
posted @ 2013-08-10 23:38 feiling 阅读(242) 评论(0) 推荐(0) 编辑
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 = 22, 5 / \ 4 8 / / \ 11 13 4 / \ / \ 7 2 5 1return[ [5,4,11,2]... 阅读全文
posted @ 2013-08-10 23:35 feiling 阅读(205) 评论(0) 推荐(0) 编辑