代码随想录算法训练营第3天| 203.移除链表元素 、707.设计链表、206.反转链表

第一题和第三题比较基础 都是基本操作

第二题由于边界问题老是过不去 最后也是磕磕绊绊做完了 需要巩固

Leetcode 203 移除链表元素

class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        //while循环 符合条件跳过
        ListNode* newhead = new ListNode;
        newhead->next=head;
        ListNode*p = newhead;
        //放一个头结点
        //遍历链表 当值相等时 
        while(p!= nullptr){
            while(p ->next != nullptr&&p->next->val==val) p->next=p->next->next;//因为有可能有连续的好多6所以用while
            p=p->next;
        }
        return newhead->next;
    }
};

Leetcode 707 设计链表

应该单独再为链表结点写一个类或结构体

class MyLinkedList {
public:
    struct ListNode {
        int val;
        ListNode* next;
        ListNode(int x) : val(x), next(nullptr) {}
    };
    
    ListNode* head;
    int len;
    
    MyLinkedList() {
        head = nullptr; // 初始化 head 为 nullptr
        len = 0;
    }

    int get(int index) {
        if (index < 0 || index >= len)
            return -1;
        ListNode* p = head;
        for (int i = 0; i < index; i++) {
            p = p->next;
        }
        return p->val;
    }

    void addAtHead(int val) {
        ListNode* newHead = new ListNode(val);
        newHead->next = head;
        head = newHead;
        len++;
    }

    void addAtTail(int val) {
        ListNode* newNode = new ListNode(val);
        if (head == nullptr) {
            head = newNode;
        } else {
            ListNode* p = head;
            while (p->next != nullptr) {
                p = p->next;
            }
            p->next = newNode;
        }
        len++;
    }

    void addAtIndex(int index, int val) {
        if (index < 0 || index > len)
            return;
        if (index == 0) {
            addAtHead(val);
        } else {
            ListNode* p = head;
            for (int i = 0; i < index - 1; i++) {
                p = p->next;
            }
            ListNode* newNode = new ListNode(val);
            newNode->next = p->next;
            p->next = newNode;
            len++;
        }
    }

    void deleteAtIndex(int index) {
        if (index < 0 || index >= len)
            return;
        if (index == 0) {
            ListNode* temp = head;
            head = head->next;
            delete temp;
        } else {
            ListNode* p = head;
            for (int i = 0; i < index - 1; i++) {
                p = p->next;
            }
            ListNode* temp = p->next;
            p->next = temp->next;
            delete temp;
        }
        len--;
    }
};

Leetcode 206 反转链表

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode* p;
        ListNode* prev = nullptr;
        if(head != nullptr){
            p = head;
            prev = nullptr;
            while(p!=nullptr){
                ListNode* temp = p->next;
                p->next = prev;
                prev = p;
                p = temp;
            }
        }
        return prev;
    }
};