摘要: Source Problem Given a linked list, swap every two adjacent nodes and return its head. Example Given 1->2->3->4, you should return the list as 2->1->4 阅读全文
posted @ 2023-06-11 13:40 凌雨尘 阅读(9) 评论(0) 推荐(0) 编辑