Fork me on GitHub
2016年10月19日
leetcode24，交换链表相邻的节点
摘要： Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your 阅读全文
posted @ 2016-10-19 23:47 LinkinStar 阅读(2436) 评论(0) 推荐(0) 编辑