leetcode-day9:Swap Nodes in Pairs(两两交换链表中的节点)

24. Swap Nodes in Pairs

链表：两两交换链表中的节点

Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list’s nodes (i.e., only nodes themselves may be changed.)

Example 1:

Input: head = [1,2,3,4]
Output: [2,1,4,3]

Example 2:

Input: head = []
Output: []

Example 3:

Input: head = [1]
Output: [1]

Constraints:

The number of nodes in the list is in the range [0, 100].
0 <= Node.val <= 100

JAVA实现代码：

逻辑分析：

- 1.为了不把头节点单独处理，因此加入虚头节点
- 2.pre用于定位，交换cur和next位置
- 3.变量变换：交换后pre赋值为上次的next
   如此往复循环，直到pre没有下一个节点或者没有下下个节点。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode swapPairs(ListNode head) {
        ListNode summy = new ListNode(0,head);
        ListNode pre = summy;

        while(pre.next!=null && pre.next.next!=null){
            ListNode cur = pre.next;
            ListNode next = cur.next;
            ListNode temp = next.next;
            
            pre.next=next;
            next.next=cur;
            cur.next=temp;

            pre=pre.next.next;
        }
        return summy.next;
        
    }
}