摘要： Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文

摘要： Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.本题是多链表融合，可以选择利用归并算法思想，两两链表融合后再归并，也可以一起融合。本文是一起融合的想法，利用... 阅读全文