Follow up for "Search in Rotated Sorted
Array":What ifduplicatesare allowed?Would this affect the run-time complexity?
How and why?Write a function to...
分类：
其他好文 时间：
2014-06-04 20:17:05
阅读次数：
249
Given a sorted array and a target value, return
the index if the target is found. If not, return the index where it would be if
it were inserted in or...
分类：
其他好文 时间：
2014-06-04 20:09:47
阅读次数：
266
Merge two sorted linked lists and return it as
a new list. The new list should be made by splicing together the nodes of the
first two lists./***Defin...
分类：
其他好文 时间：
2014-06-04 19:23:45
阅读次数：
243
Given a sorted linked list, delete all
duplicates such that each element appear onlyonce.For
example,Given1->1->2, return1->2.Given1->1->2->3->3,
retu...
分类：
其他好文 时间：
2014-06-04 19:19:16
阅读次数：
205
Follow up for "Remove Duplicates":What if
duplicates are allowed at mosttwice?For example,Given sorted array A
=[1,1,1,2,2,3],Your function should ret...
分类：
其他好文 时间：
2014-06-04 19:12:47
阅读次数：
273
原题地址：https://oj.leetcode.com/problems/median-of-two-sorted-arrays/题意：There
are two sorted arrays A and B of size m and n respectively. Find the median...
分类：
编程语言 时间：
2014-06-04 18:52:31
阅读次数：
356
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...
分类：
其他好文 时间：
2014-06-04 18:18:08
阅读次数：
259
class Solution {public: ListNode
*mergeKLists(vector &lists) { ListNode* merged = NULL; for (int i=0; ival
val) { n...
分类：
其他好文 时间：
2014-06-03 13:26:43
阅读次数：
219
class Solution {public: void merge(int A[], int
m, int B[], int n) { int mi = m + n - 1; int ai = m - 1; int bi = n - 1; ...
分类：
其他好文 时间：
2014-06-03 12:57:28
阅读次数：
217
Given an array where elements are sorted in
ascending order, convert it to a height balanced BST./** * Definition for binary
tree * struct TreeNode { ...
分类：
其他好文 时间：
2014-05-30 15:10:23
阅读次数：
227
