leetcode.206\24反转链表

lc206反转链表

难点在于，当我修改cur.next之后，我原链表没办法借助cur.next进行正常的迭代，所以需要temp来记录

递归

class Solution:
    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        def recursion_reverse(pre, cur):
            if not cur:
                return pre
            temp = cur.next
            cur.next = pre
            pre = cur
            cur = temp
            return recursion_reverse(pre, cur)

        return recursion_reverse(None, head)

迭代

class Solution:
    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        pre = None
        cur = head
        while cur:
            temp = cur.next
            cur.next = pre
            pre = cur
            cur = temp
        return pre

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

我将要交换的两个相邻节点为A——>B，我设A之前的节点为pre，设A为cur（即两者中的前者）

做如下操作：

pre.next = cur.next

cur.next.next = cur(反转）

cur.next = cur.next.next（但此时发现已被前面修改，所以应该用temp记住）

class Solution:
    def swapPairs(self, head: Optional[ListNode]) -> Optional[ListNode]:
        dummy_head = ListNode()
        dummy_head.next = head
        pre = dummy_head
        cur = head
        while cur and cur.next:
            temp = cur.next.next
            pre.next = cur.next
            cur.next.next = cur
            cur.next = temp
            pre = cur
            cur = cur.next
        return dummy_head.next