Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?
For example,
Given sorted array A = [1,1,1,2,2,3],
Your function should return length = 5, and A is now [1,1,2,...
分类：
其他好文 时间：
2015-01-13 12:38:15
阅读次数：
134
Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the...
分类：
其他好文 时间：
2015-01-13 12:33:11
阅读次数：
118
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
Integers in each row are sorted from left to right.The first integer of each...
分类：
其他好文 时间：
2015-01-13 09:00:00
阅读次数：
104
【题目】
Sort a linked list in O(n log n)
time using constant space complexity.
【分析】
单链表适合用归并排序，双向链表适合用快速排序。本题可以复用Merge Two Sorted Lists方法
【代码】
/*********************************
* 日期：2015-01-1...
分类：
其他好文 时间：
2015-01-13 00:10:40
阅读次数：
184
Merge k Sorted ListsMergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.采用优先队列priority_queue把ListNode放入优先队...
分类：
其他好文 时间：
2015-01-12 23:57:44
阅读次数：
266
Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.思路：我自己的，每次找k个元素的最小的接在答案链表的后面。结果超时了。 ListNode *merge...
分类：
其他好文 时间：
2015-01-12 23:44:13
阅读次数：
249
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.
Try to solve it in linear time/space.
Return 0 if the array contains less than 2 elements.
Y...
分类：
编程语言 时间：
2015-01-12 22:34:27
阅读次数：
274
Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Suppose a sorted array is rotated at some pivot u...
分类：
其他好文 时间：
2015-01-12 21:04:07
阅读次数：
224
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 equal to m + n) to hold additional elements from ...
分类：
编程语言 时间：
2015-01-12 21:01:06
阅读次数：
280
找到两个已排序数组的中间值，如输入{2,3,5}，{4,6}，输出4，若输入{2,3,5}，{4,6,8}，则输出4.5。因为是两个已排序数组，我想到的是用归并排序的思想，排序后数组中间的那个数，或中间两个数的平均数即为所求的median。
{CSDN:CODE:577991}...
分类：
其他好文 时间：
2015-01-12 16:31:23
阅读次数：
186
