2018年10月5日
24. Swap Nodes in Pairs
摘要： Given a linked list, swap every two adjacent nodes and return its head. Example: Note: Your algorithm should use only constant extra space. You may no 阅读全文
posted @ 2018-10-05 21:52 Veritas_des_Liberty 阅读(182) 评论(0) 推荐(0)
23. Merge k Sorted Lists
摘要： Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example: AC code: Runtime: 56 ms, faster than 26.25 阅读全文
posted @ 2018-10-05 21:07 Veritas_des_Liberty 阅读(124) 评论(0) 推荐(0)