49. leetCode24: Swap Nodes in Pairs【两两交换列表元素】

【题目】：

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 algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be change

【分析】：

1. 新建一个链表，把交换后的节点存到该链表中

2.直接改变链表的顺序

【参考】：discuss of leetcode

【Python代码1】：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def swapPairs(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head:
            return None

        dummy = ListNode(0)
        current = dummy
        while head != None:
            if head.next:
                current.next = ListNode(head.next.val)
                current.next.next = ListNode(head.val)
                head = head.next.next
                current = current.next.next
            else:
                current.next = ListNode(head.val)
                head = head.next

        return dummy.next
               

【Python代码2】：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def swapPairs(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """

        dummy = ListNode(0)
        current = dummy
        current.next = head
        
        while current.next and current.next.next:
            p1, p2 = current.next, current.next.next
            current.next, p1.next, p2.next = p2, p2.next, p1
            current = current.next.next

        return dummy.next