2017年7月29日
[Leetcode] Binary tree-- 113. 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 and sum 阅读全文
posted @ 2017-07-29 21:29 安新 阅读(226) 评论(0) 推荐(0)
[Leetcode] Binary tree--112. Path Sum
摘要： 112. 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 th 阅读全文
posted @ 2017-07-29 10:04 安新 阅读(126) 评论(0) 推荐(0)