1、
??
Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in...
分类：
其他好文 时间：
2014-06-03 03:13:59
阅读次数：
195
早上做数据迁移，部署完slave2,发现3台机子的日志狂刷：旧slave：2014-05-29 14:35:35 996 [Note] Slave: received end packet from server, apparent master shutdown:
2014-05-29 14:35:35 996 [Note] Slave I/O thread: Failed reading l...
分类：
其他好文 时间：
2014-06-03 01:52:25
阅读次数：
327
【题目】原文：1.3 Design an algorithm and write code
to remove the duplicate characters in a string without using any additional
buffer. NOTE: One or two add...
分类：
其他好文 时间：
2014-06-02 21:32:04
阅读次数：
284
【题目】
Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,
return 1->4->3->2->5->NULL.
Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.
【题意】
...
分类：
其他好文 时间：
2014-06-01 15:08:34
阅读次数：
237
【题目】
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
2
/
3
return [1,3,2].
Note: Recursive solution is trivial, could you do it iteratively?
confused what "{1,#,2...
分类：
其他好文 时间：
2014-06-01 13:01:23
阅读次数：
279
Merge Sorted ArrayGiven two sorted integer
arrays A and B, merge B into A as one sorted array.Note: You may assume that A
has enough space (size that ...
分类：
其他好文 时间：
2014-06-01 12:04:32
阅读次数：
175
【题目】
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are...
分类：
其他好文 时间：
2014-06-01 09:21:16
阅读次数：
292
Description
Some strange code is sent to Da Shan High School. It's said to be the prophet's note. The note is extremely hard to understand. However, Professor Meng is so smart that he successfully ...
分类：
其他好文 时间：
2014-06-01 09:18:38
阅读次数：
246
【题目】
Given a collection of integers that might contain duplicates, S, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For example,
If S = [1,2,2], a solution ...
分类：
其他好文 时间：
2014-06-01 08:51:06
阅读次数：
292
Optional: Get, Compile, Install QWT 5.0.0 (or
newer): * NOTE: You should not need to set the environment variables “QTDIR” or
“QWT_CFLAGS”, so leave t...
分类：
系统相关 时间：
2014-05-31 20:53:04
阅读次数：
500
