leetcode刷题 day7 | 链表：反转+交换

知识点

---

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

dummyHead = ListNode(0)
dummyHead.next = head
temp = dummyHead

dummy_head=ListNode(next=head)
cur=dummy_head

题目

---

206. 反转链表

• 给你单链表的头节点 head ，请你反转链表，并返回反转后的链表。
• 示例：
  输入：head = [1,2,3,4,5]
  输出：[5,4,3,2,1]

解法①：双指针

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
      
class Solution:
 
    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        cur=head
        pre=None
        while(cur):
           temp=cur.next
           cur.next=pre
           pre=cur
           cur=temp
        return pre

解法②：递归

def reverse(cur,pre):
    if (cur==None): return pre
    temp=cur.next
    cur.next=pre
    return reverse(temp,cur)
        
class Solution:

    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        return reverse(head,None) 

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

• 给你一个链表，两两交换其中相邻的节点，并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题（即，只能进行节点交换）。
• 示例：
  输入：head = [1,2,3,4]
  输出：[2,1,4,3]

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

        return dummy_head.next