【无标题】

代码随想录刷题-Day4-链表-C++

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

class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        //新建一个结构体指针
        ListNode *dumpHead = new ListNode(0);
        dumpHead->next = head;
        ListNode *temp = dumpHead;
        while(temp->next != nullptr && temp->next->next != nullptr) {
            ListNode *node1 = temp->next;
            ListNode *node2 = temp->next->next;

            temp->next = node2;
            node1->next = node2->next;
            node2->next = node1;
            temp = node1;
            /*
            int val = node1->val;
            node1->val = node2->val;
            node2->val = val;            
            temp = temp->next->next;
            */

        }

        return dumpHead->next;

    }

    
};

直接交换指针指向的地址为最优解，时间和内存占用都最小

注释掉部分，仅交换节点的值也能通过，应该是因为leetcode用例判断没有考虑的原因。

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

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        //ListNode* dumpHead = new ListNode(0);
        //dumpHead->next = head;
        ListNode* current = head;
        int count =0;
        while (current != nullptr){
            count++;
            if(current->next == nullptr)
                break;
            
            current = current->next;
        }

        int num = count - n;

        if(num == 0) {
            return head->next;
        }

        //cout << count << "a" << num ;

        ListNode* cur = head;
        int c = 0;
        while (cur != nullptr){
            c++;
            if(cur->next == nullptr)
                break;

            if(c == num){
                //count << cur->val ;
                cur->next = cur->next->next;
            }
            
            cur = cur->next;
        }


        return head;

    }
};

跌跌撞撞，对C++的调试还需要继续学习。