LeetCode—swap-nodes-in-pairs（成对结点的交换）—java

题目描述：java Given a linked list, swap every two adjacent nodes and return its head.node For example, Given1->2->3->4, you should return the list as2->1->4->3.spa Your algorithm should use only constant

>>阅读原文<<