Neal is very curious about combinatorial problems, and now here comes a problem about words. Knowingthat Ray has a photographic memory and this may no...
分类：
其他好文 时间：
2014-08-13 17:54:56
阅读次数：
260
Insertion Sort is a simple sorting technique which was covered in previous challenges. Sometimes, arrays may be too large for us to wait around for in...
分类：
其他好文 时间：
2014-08-12 18:13:14
阅读次数：
404
题目：
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
P A H N
A P L S I I G
Y I R
And then read line by line: "PAHNAPLSIIG...
分类：
其他好文 时间：
2014-08-12 00:47:43
阅读次数：
196
Binary Tree Maximum Path SumGiven a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the be...
分类：
其他好文 时间：
2014-08-11 21:13:02
阅读次数：
219
When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, we may call for food delivery.
Suppose there are N people living ...
分类：
其他好文 时间：
2014-08-11 15:02:22
阅读次数：
333
题意：给你一组数n m n的意思是有多少个村庄，并且给你n-1个关系，m的意思是要你连通的村庄。现在要你求出连通m个村庄所花费的钱
思路：题目一看数据，就像是要你去求最小生成树的子数，但是仔细审题会发现一句“Meanwhile you should use the least money. You may suppose that the initial transportation net...
分类：
其他好文 时间：
2014-08-11 12:06:42
阅读次数：
188
Grid Infrastructure共享组件Grid Infrastructure使用两种类型的共享设备来管理集群资源和节点：OCR(Oracle Cluster Registry)和表决磁盘。Oracle 11.2引入一个新的文件，称作Oracle Local Registry(OLR)，它只允...
分类：
数据库 时间：
2014-08-11 02:48:01
阅读次数：
439
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array....
分类：
其他好文 时间：
2014-08-10 18:48:50
阅读次数：
203
A so juicy and interesting problem! Recommend to everyone!A final solution may not jump into your mind immediately, of course, DP is not a trivial top...
分类：
其他好文 时间：
2014-08-10 15:37:00
阅读次数：
209
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
给出二叉树的中序遍历和后序遍历结果，恢复出二叉树。
后序遍历序列的最后一个元素值是二叉树的根节点的值，查找...
分类：
其他好文 时间：
2014-08-09 23:15:09
阅读次数：
312
