题目：Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or e....
分类：
编程语言 时间：
2014-07-28 14:47:23
阅读次数：
1108
题目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 should b...
分类：
其他好文 时间：
2014-07-27 22:49:39
阅读次数：
176
题目：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space....
分类：
编程语言 时间：
2014-07-27 21:26:35
阅读次数：
267
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 should be ...
分类：
其他好文 时间：
2014-07-27 09:53:12
阅读次数：
350
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).
You are given a target value to search. If found in the array retur...
分类：
其他好文 时间：
2014-07-26 15:16:50
阅读次数：
199
今天用python自带的sorted对一个列表进行排序， 在这里总结一下只要是可迭代对象都可以用sorted 。sorted(itrearble, cmp=None, key=None, reverse=False)=号后面是默认值 默认是升序排序的， 如果想让结果降序排列，用reverse=Tru...
分类：
编程语言 时间：
2014-07-26 14:49:40
阅读次数：
284
题目：Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.题解：Merge k sorted linked list就是merge 2 sorted li....
分类：
编程语言 时间：
2014-07-26 05:44:37
阅读次数：
304
Merge Sorted ArrayGiven two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that i...
分类：
其他好文 时间：
2014-07-25 02:34:44
阅读次数：
162
一. redis
Redis is an in-memory database that persists on disk. The data model is key-value, but many different kind of values are supported: Strings, Lists, Sets, Sorted Sets, Hashes
http...
分类：
其他好文 时间：
2014-07-24 10:32:58
阅读次数：
223
python 字典排序http://www.cnblogs.com/kaituorensheng/archive/2012/08/07/2627386.html函数原型sorted(dic,value,reverse)dic为比较函数，value 为排序的对象（这里指键或键值），reverse：注明...
分类：
编程语言 时间：
2014-07-23 20:52:35
阅读次数：
183
