Given a strings1, we may represent it as a
binary tree by partitioning it to two non-empty substrings recursively.Below is
one possible representation...
分类：
其他好文 时间：
2014-06-04 20:11:38
阅读次数：
303
Given a set ofnon-overlappingintervals, insert
a new interval into the intervals (merge if necessary).You may assume that the
intervals were initially...
分类：
其他好文 时间：
2014-06-04 20:10:23
阅读次数：
204
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-06-04 18:18:08
阅读次数：
259
Say you have an array for which theithelement
is the price of a given stock on dayi.Design an algorithm to find the maximum
profit. You may complete a...
分类：
其他好文 时间：
2014-05-30 16:19:05
阅读次数：
320
Given inorder and postorder traversal of a
tree, construct the binary tree.Note:You may assume that duplicates do not exist
in the tree./** * Definiti...
分类：
其他好文 时间：
2014-05-30 16:12:22
阅读次数：
288
Given a binary tree, find the maximum path
sum.The path may start and end at any node in the tree.For example:Given the
below binary tree, 1 ...
分类：
其他好文 时间：
2014-05-30 16:10:54
阅读次数：
185
Given preorder and inorder traversal of a tree,
construct the binary tree.Note:You may assume that duplicates do not exist in
the tree./** * Definitio...
分类：
其他好文 时间：
2014-05-30 16:02:40
阅读次数：
289
Evaluate the value of an arithmetic expression
inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an
integer or another express...
分类：
其他好文 时间：
2014-05-30 15:22:39
阅读次数：
301
Say you have an array for which theithelement
is the price of a given stock on dayi.Design an algorithm to find the maximum
profit. You may complete a...
分类：
其他好文 时间：
2014-05-30 15:00:54
阅读次数：
335
题意:computing a max-spacingk-clustering.spacing 是指两个
cluster 之间的最小距离输入:[number_of_nodes][edge 1 node 1] [edge 1 node 2] [edge 1
cost][edge 2 node 1] [e...
分类：
其他好文 时间：
2014-05-29 20:40:30
阅读次数：
323
