摘要：
Given a binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the... 阅读全文
posted @ 2015-12-13 19:14
ZHOU YANG
阅读(263)
评论(0)
推荐(0)
摘要：
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 @ 2015-12-13 17:21
ZHOU YANG
阅读(557)
评论(0)
推荐(0)
摘要：
Given an arraySofnintegers, find three integers inSsuch that the sum is closest to a given number, target. Return the sum of the three integers. You m... 阅读全文
posted @ 2015-12-13 16:35
ZHOU YANG
阅读(171)
评论(0)
推荐(0)
摘要：
Givennballoons, indexed from0ton-1. Each balloon is painted with a number on it represented by arraynums. You are asked to burst all the balloons. If ... 阅读全文
posted @ 2015-12-13 16:12
ZHOU YANG
阅读(455)
评论(0)
推荐(0)
摘要：
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.Subscribeto se... 阅读全文
posted @ 2015-12-13 14:42
ZHOU YANG
阅读(205)
评论(0)
推荐(0)
浙公网安备 33010602011771号