链表
PKU_CXK
北京大学信息科学技术学院
展开
-
LeetCode | 23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.**可以直接两两合并,比较慢. 考虑分治算法.f(i,j)表示合并序号为i~j的链表. 如果i==j,显然不用合并. 如果i j相邻,合并v[i], v[j] 否则,二分,合并i~mid,mid+1原创 2017-04-27 18:14:27 · 249 阅读 · 0 评论 -
LeetCode | 61. Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.题意:将链表的右端的K个元素放到左边。// 16 ms/** * Definitio原创 2017-07-07 10:58:09 · 337 阅读 · 0 评论