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

 203.移除链表元素 

两种方法 1.单独处理头节点 2.使用虚拟头节点

1.单独处理头节点

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

2.使用虚拟头节点

要注意要删除的节点是哪个，不要搞错了

class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        ListNode* dummyhead = new ListNode();
        dummyhead->next = head;
        ListNode* cur = dummyhead;
        while(cur->next != NULL){
            if(cur->next->val == val){
                ListNode* tmp = cur->next;// 保存要删除的节点
                cur->next = cur->next->next;
                delete tmp;
            }else{
                cur = cur->next;
            }
        }
        head = dummyhead->next;
        delete dummyhead;
        return head;
    }
};

707.设计链表

注意点：

1.变量写在private

2.注意边界条件 如：index = _size 以及排除掉不合理的index值

class MyLinkedList {
public:
    struct LinkedNode{
        int val;
        LinkedNode* next;
        LinkedNode(int val): val(val), next(NULL){}
    };

    MyLinkedList() {
        _dummyhead = new LinkedNode(0);
        _size = 0;
    }
    
    int get(int index) {
        if(index < 0 || index > (_size - 1)){
            return -1;
        }
        LinkedNode* cur = _dummyhead;
        while(index--){
            cur = cur->next;
        }
        return cur->next->val;
    }
    
    void addAtHead(int val) {
        LinkedNode* node = new LinkedNode(val);
        node->next = _dummyhead->next;
        _dummyhead->next = node;
        _size++;
    }
    
    void addAtTail(int val) {
        LinkedNode* cur = _dummyhead;
        while(cur->next != NULL){
            cur = cur->next;
        }
        LinkedNode* node = new LinkedNode(val);
        cur->next = node;
        _size++;
    }
    
    void addAtIndex(int index, int val) {
        if(index > _size || index < 0) return;
        if(index == _size){
            addAtTail(val);
            return;
        }
        LinkedNode* cur = _dummyhead;
        while(index--){
            cur = cur->next;
        }
        LinkedNode* node = new LinkedNode(val);
        node->next = cur->next;
        cur->next = node;
        _size++;
    }
    
    void deleteAtIndex(int index) {
        if(index > _size - 1 || index < 0) return;
        LinkedNode* cur = _dummyhead;
        while(index--){
            cur = cur->next;
        }
        LinkedNode* tmp = cur->next;
        cur->next = cur->next->next;
        delete tmp;
        _size--;
    }

private:
    int _size;
    LinkedNode* _dummyhead;
};

 206.反转链表

1.双指针法

注意：tmp先记录cur->next

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

2. 递归法

要常温习，容易忘！

class Solution {
public:
    ListNode* reverse(ListNode* pre, ListNode* cur){
        if(!cur) return pre;
        ListNode* tmp = cur->next;
        cur->next = pre;
        return reverse(cur, tmp);
    }

    ListNode* reverseList(ListNode* head) {
        return reverse(NULL, head);
    }
};