20231206-Day 9-点亮代码技能

Leetcode24（代码随想录：两两交换链表中的节点）

C++：

注意：while循环条件的顺序不能更改，否则会导致空指针异常。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        ListNode *dummy_head = new ListNode(0);
        dummy_head->next = head;
        ListNode *cur = dummy_head;
        while(cur->next != nullptr && cur->next->next != nullptr)
        {
            ListNode *temp1 = cur->next;
            // ListNode *temp2 = dummy_head->next->next->next;
            cur->next = cur->next->next;
            temp1->next = temp1->next->next;
            cur->next->next = temp1;
            cur = cur->next->next;
        }
        return dummy_head->next;
    }
};

Python：

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