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

203.移除链表元素

参考资料：代码随想录 (programmercarl.com)

之前参考代码随想录做过一次，知道可以设置虚拟头节点。

class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
       ListNode* dummyhead = new ListNode(0);
       dummyhead->next = head;
       ListNode* cur = dummyhead;
       while (cur->next) {
            if (cur->next->val == val) {
                cur->next = cur->next->next;
            }
            else {
                cur = cur->next;
            }
       }
       return dummyhead->next;
    }
};

707.设计链表

参考资料：代码随想录 (programmercarl.com)

中等题，覆盖了链表的常见操作，但自己动手写还是出错，照着代码随想录一步一步写。

class MyLinkedList {
private:
    int _size;
    LinkedNode* _dummyHead;
public:
    struct LinkedNode {
        int val;
        LinkedNode* next;
        LinkedNode(int val):val(val), next(nullptr){}
    };

    MyLinkedList() {
        _dummyHead = new LinkedNode(0); 
        _size = 0;
    }

    int get(int index) {
        if (index > (_size - 1) || index < 0) {
            return -1;
        }
        LinkedNode* cur = _dummyHead->next;
        while(index--){
            cur = cur->next;
        }
        return cur->val;
    }

    void addAtHead(int val) {
        LinkedNode* newNode = new LinkedNode(val);
        newNode->next = _dummyHead->next;
        _dummyHead->next = newNode;
        _size++;
    }

    void addAtTail(int val) {
        LinkedNode* newNode = new LinkedNode(val);
        LinkedNode* cur = _dummyHead;
        while(cur->next != nullptr){
            cur = cur->next;
        }
        cur->next = newNode;
        _size++;
    }

    void addAtIndex(int index, int val) {

        if(index > _size) return;
        if(index < 0) index = 0;        
        LinkedNode* newNode = new LinkedNode(val);
        LinkedNode* cur = _dummyHead;
        while(index--) {
            cur = cur->next;
        }
        newNode->next = cur->next;
        cur->next = newNode;
        _size++;
    }

    void deleteAtIndex(int index) {
        if (index >= _size || index < 0) {
            return;
        }
        LinkedNode* cur = _dummyHead;
        while(index--) {
            cur = cur ->next;
        }
        LinkedNode* tmp = cur->next;
        cur->next = cur->next->next;
        delete tmp;
        tmp=nullptr;
        _size--;
    }

    void printLinkedList() {
        LinkedNode* cur = _dummyHead;
        while (cur->next != nullptr) {
            cout << cur->next->val << " ";
            cur = cur->next;
        }
        cout << endl;
    }
};

206.反转链表

首先想到的是采用双指针法。

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

看了卡哥的解法发现还能递归。

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

总结

链表还是什么考验思路的，刷题上还有很长的路要走。