代码随想录第3天|链表

203.移除链表元素

常规题：注意使用虚拟头节点的思路

class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        ListNode newhead(0, head);
        ListNode* pre = &newhead;
        ListNode* cur = head;
        while (cur != nullptr) {
            if (cur->val == val) {
                pre->next = pre->next->next;
                delete cur;
                cur = pre->next;
            } else {
                pre = pre->next;
                cur = cur->next;
            }
        }
        return newhead.next;
    }
};

另一种写法, 使用一个指针进行遍历

---

707.设计链表

Bug：

• 一刷时超时，可能由于没用变量记录长度的原因
• 主要复习结构体的用法

class MyLinkedList {
public:
    struct MyNode {
        MyNode* next;
        int val;
        MyNode(int x) :val(x), next(nullptr) {}
    };
    int length;
    MyNode* head;
    MyLinkedList() {
        head = new MyNode(0);
        length = 0;
    }

    int get(int index) {
       /* if (index > length) return -1;
        //错误操作
        //若大小为size，其中index是索引，范围在[0,size-1]
       */
        if (index > (length - 1)) {
            return -1;
        }
        MyNode* cur = head;
        while (index--) {
            cur = cur->next;
        }
        return cur->next->val;
    }

    void addAtHead(int val) {
        MyNode* tem = new MyNode(val);
        tem->next = head->next;
        head->next = tem;
        length++;
    }

    void addAtTail(int val) {
        MyNode* tem = new MyNode(val);
        MyNode* cur = head;
        while (cur->next != nullptr) {
            cur = cur->next;
        }
        cur->next = tem;
        length++;
    }

    void addAtIndex(int index, int val) {
        /*if (index > length - 1) return;
         * 错误操作： 
         *      需要超出索引范围, 否则无法在末尾插入数据
         */
        if (index > length) return;
        MyNode* cur = head;
        while (index--) {
            cur = cur->next;
        }
        MyNode* tem = new MyNode(val);
        tem->next = cur->next;
        cur->next = tem;
        length++;
    }

    void deleteAtIndex(int index) {
        if (index > length - 1) return;
        MyNode* cur = head;
        while (index--) {
            cur = cur->next;
        }
        MyNode* tem = cur->next;
        cur->next = cur->next->next;
        delete tem;
        length--;
    }
};

---

206.反转链表

常规题：使用双指针实现

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode *pre = nullptr, *cur = head;
        while (cur) {
            ListNode* tem = cur->next;
            cur->next = pre;
            pre = cur;
            cur = tem;
        }
        return pre;
    }
};

需要补充递归法