2019年9月4日
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. Note: A leaf is a node with no children. Exampl 阅读全文
posted @ 2019-09-04 09:21 Schwifty 阅读(131) 评论(0) 推荐(0)
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 the given sum. N 阅读全文
posted @ 2019-09-04 06:44 Schwifty 阅读(120) 评论(0) 推荐(0)