摘要: Given a linked list, swap every two adjacent nodes and return its head. You may not modify the values in the list's nodes. Only nodes itself may be ch 阅读全文
posted @ 2020-12-07 18:40 diameter 阅读(95) 评论(0) 推荐(0) 编辑
摘要: You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list 阅读全文
posted @ 2020-12-07 17:58 diameter 阅读(94) 评论(0) 推荐(0) 编辑