Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).
题目在这：http://poj.org/problem?id=1151AtlantisTime Limit:1000MSMemory Limit:10000KDescriptionThere are several ancient Greek texts that contain descripti...
分类：
其他好文 时间：
2014-07-07 13:04:50
阅读次数：
157
Divide an array into the maximum number of same((-))sized blocks, each of which should contain an index P such that A[P - 1] A[P + 1].
分类：
其他好文 时间：
2014-07-06 15:30:31
阅读次数：
465
the request doesn't contain a multipart/form-data or multipart/form-data stream, content type header一，HTTP上传的基本知识 在Form元素的语法中，EncType表明提交数据的格式 用 Encty...
分类：
其他好文 时间：
2014-07-06 13:16:31
阅读次数：
280
Given a collection of integers that might contain duplicates, S, return all possible subsets.
分类：
其他好文 时间：
2014-07-02 20:19:21
阅读次数：
179
题目
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it a...
分类：
其他好文 时间：
2014-07-01 09:11:07
阅读次数：
206
题目
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).
For example,
S = "ADOBECODEBANC"
T = "ABC"
Minimum wi...
Problem :It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and ...
分类：
其他好文 时间：
2014-06-28 08:13:17
阅读次数：
249
题目
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
For example,
[1,1,2] have the following unique permutations:
[1,1,2], [1,2,1],
...
分类：
其他好文 时间：
2014-06-27 23:53:21
阅读次数：
290
题目：You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a sing...
分类：
其他好文 时间：
2014-06-27 11:38:12
阅读次数：
207
