题目：Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following unique p...
分类：
其他好文 时间：
2015-05-21 17:23:55
阅读次数：
132
FindMinimuminRotatedSortedArrayIITotalAccepted:25678TotalSubmissions:80978MySubmissionsQuestionSolutionFollowupfor"FindMinimuminRotatedSortedArray":Whatifduplicatesareallowed?Wouldthisaffecttherun-timecomplexity?Howandwhy?Supposeasortedarrayisrotatedatsomep..
分类：
其他好文 时间：
2015-05-21 06:44:54
阅读次数：
162
题目：Given a collection of integers that might contain duplicates,nums, return all possible subsets.Note:Elements in a subset must be in non-descending ...
分类：
其他好文 时间：
2015-05-20 23:55:00
阅读次数：
181
leetcode 2 – Add Two Numbers
题目：
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 t...
分类：
其他好文 时间：
2015-05-20 16:22:34
阅读次数：
110
Given a collection of integers that might contain duplicates, nums, return all possible subsets.Note:Elements in a subset must be in non-descending or...
分类：
编程语言 时间：
2015-05-20 02:02:01
阅读次数：
154
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 = "ADOBECOD...
分类：
编程语言 时间：
2015-05-18 22:48:32
阅读次数：
272
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 as a l...
分类：
其他好文 时间：
2015-05-18 21:18:42
阅读次数：
106
题目描述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...
分类：
其他好文 时间：
2015-05-18 18:57:11
阅读次数：
119
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 18723
Accepted: 7105
Description
There are several ancient Greek texts that contain descriptions of the fabled islan...
分类：
其他好文 时间：
2015-05-17 18:43:55
阅读次数：
102
题意
A array contain N number, can you tell me how many different pair i,j that satisfy a[i] + a[j] = M and 1
0
思路：
用map记录会超时
所以想到手写二分。思考一下其实满足题目条件的对数和每个数字的位置并没有关系——排序+二分查找（范围来确定个数）即可。
code：
...
分类：
其他好文 时间：
2015-05-16 16:35:53
阅读次数：
98
