24. 两两交换链表中的节点

题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:

# 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
        """
        #将链表抽成列表
        li = []
        a = head
        while a is not None:
            li.append(a)
            a=a.next
        
        #两两交换相邻节点
        i = 0
        while i < len(li):
            j = i + 1
            if j < len(li):
                li[i],li[j] = li[j],li[i]
            else:
                break
            i = i + 2
        
        #将节点列表组成新的链表
        listnode = ListNode(0)   #新链表
        c = listnode             #当前节点/指针
        for j in range(0,len(li)):
            c.val = li[j].val
            c.next = None if j == len(li)-1 else li[j+1]
            c = c.next
            
        #当节点列表个数为0时，返回 None
        if len(li) == 0:
            return None
        else:
            return listnode