2014.06.18 14:16简介: “并查集”,英文名为“union-find set”,从名字就能看出来它支持合并与查找功能。另外还有一个名字叫“disjoint set”,中文名叫不相交集合。可能我们倾向于用最短的名字,所以就出现了“并查集”翻译为“disjoint set”的情况。并查集....
分类:
编程语言 时间:
2014-06-28 19:55:37
阅读次数:
331
struts.xml中为了与struts1的MVC模式整合,需要类似如下的拦截器的引用 ...
分类:
其他好文 时间:
2014-06-21 13:52:14
阅读次数:
252
Question:There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity s...
分类:
其他好文 时间:
2014-06-21 08:34:52
阅读次数:
172
Longest Palindromic Substring:Given a stringS, find the longest palindromic substring inS.You may assume that the maximum length ofSis 1000, and there...
分类:
其他好文 时间:
2014-06-21 07:36:18
阅读次数:
227
fstream流的eof()推断有点不合常理 按常理逻辑来说,假设到了文件末尾的话,eof()应该返回真,可是,C++输入输出流怎样知道是否到末尾了呢? 原来依据的是:假设fin>>不能再读入数据了,才发现到了文件结尾,这时才给流设定文件结尾的标志,此后调用eof()时,才返回真。 如果 find....
分类:
编程语言 时间:
2014-06-21 07:29:29
阅读次数:
262
Triangle:Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, give...
分类:
其他好文 时间:
2014-06-21 07:02:07
阅读次数:
203
Description:Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesame...
分类:
其他好文 时间:
2014-06-21 06:55:48
阅读次数:
200
// Question: There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexi...
分类:
其他好文 时间:
2014-06-21 00:22:23
阅读次数:
255
When you find yourself calling the same function and passing mostly the same parameters, then the function is probably a good candidate for currying. ...
分类:
编程语言 时间:
2014-06-21 00:20:34
阅读次数:
297
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeate...
分类:
其他好文 时间:
2014-06-20 23:37:29
阅读次数:
195