摘要：
Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you 阅读全文
posted @ 2016-05-02 22:11
Miller1991
阅读(91)
评论(0)
推荐(0)
摘要：
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space fo 阅读全文
posted @ 2016-05-02 21:47
Miller1991
阅读(94)
评论(0)
推荐(0)
摘要：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: But the fol 阅读全文
posted @ 2016-05-02 21:21
Miller1991
阅读(132)
评论(0)
推荐(0)
摘要：
Implement the following operations of a queue using stacks. push(x) -- Push element x to the back of queue. pop() -- Removes the element from in front 阅读全文
posted @ 2016-05-02 20:36
Miller1991
阅读(143)
评论(0)
推荐(0)
摘要：
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each hou 阅读全文
posted @ 2016-05-02 20:13
Miller1991
阅读(138)
评论(0)
推荐(0)
摘要：
After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This t 阅读全文
posted @ 2016-05-02 19:17
Miller1991
阅读(149)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For 阅读全文
posted @ 2016-05-02 17:02
Miller1991
阅读(131)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree { 阅读全文
posted @ 2016-05-02 16:56
Miller1991
阅读(185)
评论(0)
推荐(0)
浙公网安备 33010602011771号