码迷,mamicode.com
首页 >  
搜索关键字:merge k sorted lists    ( 11722个结果
Search Insert Position (LeetCode)
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-07-16 23:16:32    阅读次数:156
leetcode - Remove Duplicates from Sorted List
题目:Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2...
分类:其他好文   时间:2014-07-10 14:29:45    阅读次数:259
[LeetCode] Search a 2D Matrix
Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l...
分类:其他好文   时间:2014-07-10 12:37:21    阅读次数:189
web-project 故障修复功能 传递所有的event_id数据到后台
1 22 23 24 25 26 27 故障信息28 {% module Uptime() %}29 30 31 32 33 {% if lists != [] %}34 35 {% end %}36 37 {% for d in lists %...
分类:Web程序   时间:2014-07-10 12:19:55    阅读次数:150
[leetcode] Merge Two Sorted Lists
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.
分类:其他好文   时间:2014-07-10 00:18:17    阅读次数:278
LeetCode-Sort List(Python)
【问题】 Sort a linked list in O(n log n) time using constant space complexity. 【代码】 # Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # ...
分类:编程语言   时间:2014-06-28 08:29:23    阅读次数:222
Leetcode: Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord...
分类:其他好文   时间:2014-06-27 22:25:10    阅读次数:443
[leetcode] Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).
分类:其他好文   时间:2014-06-27 11:44:03    阅读次数:180
LeetCode OJ - 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 sing...
分类:其他好文   时间:2014-06-27 11:38:12    阅读次数:207
归并排序:二路归并
归并排序(Merge Sort)是将两个(或两个以上)有序表合并成一个新的有序表,即把待排序序列分为若干个有序的子序列,再把有序的子序列合并为整体有序序列。 归并排序的具体做法: 把原序列不断地递归等分,直至每等份只有一个元素,此时每等份都是有序的。 相邻等份合并,不断合并,直至合并完全。 二路归并 归并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。归并排序最常用的是二路归并,即把两个小的有序的序列和并成一个大的有序序列:合二为一...
分类:其他好文   时间:2014-06-27 10:16:41    阅读次数:315
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!