摘要：
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.You m... 阅读全文
posted @ 2014-11-16 22:55
Jessica程序猿
阅读(134)
评论(0)
推荐(0)
摘要：
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two nu... 阅读全文
posted @ 2014-11-16 20:32
Jessica程序猿
阅读(219)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文
posted @ 2014-11-16 17:18
Jessica程序猿
阅读(233)
评论(0)
推荐(0)
摘要：
Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?本来不... 阅读全文
posted @ 2014-11-16 16:00
Jessica程序猿
阅读(218)
评论(0)
推荐(0)
摘要：
Given a singly linked listL:L0→L1→…→Ln-1→Ln,reorder it to:L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For exam... 阅读全文
posted @ 2014-11-16 14:04
Jessica程序猿
阅读(164)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].二叉树... 阅读全文
posted @ 2014-11-16 12:41
Jessica程序猿
阅读(175)
评论(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 @ 2014-11-16 09:43
Jessica程序猿
阅读(223)
评论(0)
推荐(0)
浙公网安备 33010602011771号