Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4
5 6 7 0 1 2).
Find the minimum element.
The array may contain duplicates.
解...
分类：
其他好文 时间：
2015-02-10 15:22:51
阅读次数：
195
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 ...
分类：
其他好文 时间：
2015-02-10 14:49:49
阅读次数：
135
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following unique perm...
分类：
其他好文 时间：
2015-02-10 14:37:42
阅读次数：
208
Write a method that will search an array of strings for all strings that contain another string, ignoring capitalization. Then return an array of the ...
分类：
其他好文 时间：
2015-02-09 23:03:22
阅读次数：
246
Given a collection of integers that might contain duplicates,S, return all possible subsets.Note:Elements in a subset must be in non-descending order....
分类：
其他好文 时间：
2015-02-09 15:39:14
阅读次数：
131
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="ADOBECODEBA...
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following unique perm...
分类：
其他好文 时间：
2015-02-09 00:42:31
阅读次数：
150
题目链接：http://poj.org/problem?id=1064
题意：有n条绳子，他们的长度是Li，如果从他们中切割出K条长度相同的绳子，这相同的绳子每条有多长，输出至小数点后两位
“ then the output file must contain the single number "0.00" (without quotes).”不是四舍五入到两位，一般四舍五入题目会说“bou...
分类：
其他好文 时间：
2015-02-08 09:06:17
阅读次数：
260
题目要求：Permutations IIGiven a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the f...
分类：
其他好文 时间：
2015-02-07 21:30:03
阅读次数：
117
Given a set S = {1, 2, …, n}, number m and p, your job is to count how many set T satisfies the following condition: T is a subset of S
|T| = m
T does not contain continuous numbers, that is to say...
分类：
其他好文 时间：
2015-02-07 16:01:15
阅读次数：
142
