2014年3月31日
LeetCode： Path Sum 2
摘要： 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 @ 2014-03-31 21:29 andyqee 阅读(199) 评论(0) 推荐(0)