算法第四天| 24. 两两交换链表中的节点 19.删除链表的倒数第N个节点链表相交 142.环形链表II-CSDN博客

本文链接：https://blog.csdn.net/weixin_45720973/article/details/130050791

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

注意判断head->next 是否为空前需要首先判断head是否nullptr

/**
 * 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* dummyHead = new ListNode(0, head);
        ListNode* dummyHead_temp = dummyHead;
        while(head !=nullptr && head->next != nullptr){ //这里需要注意一点，就是head也需要不为null，要不然会报错，head如果是null也就没有head->next了
            ListNode* temp = head->next->next;
            dummyHead->next = head->next;
            head->next->next = head;
            head->next = temp;
            dummyHead = head;
            head = temp;
        }
        ListNode* head_0 = dummyHead_temp->next;
        delete dummyHead_temp;
        return head_0;
//我使用了这种两个临时指针，他的空间复杂度应该是多少？
    }
};

19.删除链表的倒数第N个节点

依旧是双指针法

/**
 * 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* removeNthFromEnd(ListNode* head, int n) {
        
        ListNode* dummyHead = new ListNode(0, head);
        ListNode* cur = dummyHead;
        ListNode* later = dummyHead;
        for(int i = 0; i < n; i++){
            cur = cur->next;
        }
        while(cur->next){
            cur = cur->next;
            later = later->next;
        }
        later->next = later->next->next;
        head = dummyHead->next;
        delete dummyHead;
        return head;

    }
};