题目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.
The solution set must not contain duplicate...
分类：
其他好文 时间：
2015-03-01 22:22:10
阅读次数：
226
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:...
分类：
其他好文 时间：
2015-03-01 06:47:02
阅读次数：
125
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note: Elements in a triplet (a,b,c) must ...
分类：
其他好文 时间：
2015-02-28 14:35:46
阅读次数：
140
Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. 这道题...
分类：
移动开发 时间：
2015-02-27 13:15:17
阅读次数：
156
Problem Description
Let A1, A2, … , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a given number to a few numbers in a given interval. The other is t...
分类：
其他好文 时间：
2015-02-26 21:40:35
阅读次数：
246
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.解法：自底向上 时间复杂度O(n), 空间复杂度O(logN) 1 clas...
分类：
其他好文 时间：
2015-02-26 19:58:04
阅读次数：
166
Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].
Note: Try to come up as many solutions as you c...
分类：
其他好文 时间：
2015-02-26 11:49:09
阅读次数：
104
一、document.formName.item("itemName") 问题 问题说明：IE下，可以使用 document.formName.item("itemName") 或 document.formName.elements ["elementName"]；Firefox 下，只能使用do...
分类：
Web程序 时间：
2015-02-26 11:15:30
阅读次数：
150
题目Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:
Try to come up as many solutions as you can, th...
分类：
其他好文 时间：
2015-02-25 23:46:18
阅读次数：
157
链接：click here
题意：
描述 You want to processe a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. Then how many times it nee...
分类：
编程语言 时间：
2015-02-25 21:10:08
阅读次数：
153
