[LeetCode]Swap Nodes in Pairs

Given a linked list, swap every two adjacent nodes and return its head.node For example, Given 1->2->3->4, you should return the list as 2->1->4->3.spa Your algorithm should use only constant space. Y
相關文章
相關標籤/搜索