问题描述：
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).
You may assume that the intervals were initially sorted according to their start time...
分类：
其他好文 时间：
2014-11-25 23:40:58
阅读次数：
248
;博客测试data segment tab db 'hello world$'data ends code segment assume cs:code, ds:data start: ...
分类：
其他好文 时间：
2014-11-25 18:17:24
阅读次数：
178
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...
分类：
其他好文 时间：
2014-11-25 16:00:36
阅读次数：
165
Given a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially...
分类：
其他好文 时间：
2014-11-24 20:46:06
阅读次数：
180
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.C++实现代码：#inclu...
分类：
其他好文 时间：
2014-11-24 11:47:33
阅读次数：
281
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.提交成功的代码：C++实现：#...
分类：
其他好文 时间：
2014-11-24 11:26:30
阅读次数：
251
Description
An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all code...
分类：
其他好文 时间：
2014-11-24 10:13:54
阅读次数：
214
Given a binary tree, determine if it is a valid binary search tree (BST).
Assume a BST is defined as follows:
The left subtree of a node contains only nodes with keys less than the node's key.Th...
分类：
其他好文 时间：
2014-11-24 10:11:36
阅读次数：
152
问题描述：
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
基本思路：
与前一篇《Construct Binary Tree from Preord...
分类：
其他好文 时间：
2014-11-23 11:51:28
阅读次数：
172
问题描述：
Given preorder and inorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
基本思路：
找到规律，递归的解决左子树和右子树。
代码：
/**
* D...
分类：
其他好文 时间：
2014-11-23 10:32:58
阅读次数：
190
