摘要：
Binary Tree Level Order Traversal IIGiven a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level... 阅读全文
posted @ 2015-09-14 22:52
Sean_le
阅读(110)
评论(0)
推荐(0)
摘要：
Binary Tree Level Order TraversalGiven a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).Fo... 阅读全文
posted @ 2015-09-14 16:42
Sean_le
阅读(125)
评论(0)
推荐(0)
摘要：
H-Index IIFollow upforH-Index: What if thecitationsarray is sorted in ascending order? Could you optimize your algorithm?二分查找，时间复杂度O(logn)。 1 class So... 阅读全文
posted @ 2015-09-14 11:00
Sean_le
阅读(148)
评论(0)
推荐(0)
摘要：
H-IndexGiven an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.Acc... 阅读全文
posted @ 2015-09-14 10:19
Sean_le
阅读(142)
评论(0)
推荐(0)
摘要：
Symmetric TreeGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric... 阅读全文
posted @ 2015-09-14 00:11
Sean_le
阅读(169)
评论(0)
推荐(0)
浙公网安备 33010602011771号