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

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

203.移除链表元素

//使用虚拟头节点
class Solution {
public:
    ListNode*  removeElements(ListNode* head, int val) {
        ListNode* dummyHead = new ListNode(0);
        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.设计链表

一直是WA，暂时还没有AC

class MyLinkedList {
public:
    struct LinkedNode {
        int val;
        LinkedNode* next;
        LinkedNode(int val):val(val), next(nullptr){}
    };
    
    MyLinkedList() {
        _dummyHead = new LinkedNode(0);
        _size = 0;
    }
    //返回第i个节点，从0开始（头结点是0号节点）
    int get(int index) {
        if (index > _size - 1 || index < 0) {
            return -1;
        }
        LinkedNode* cur = _dummyHead->next;
        //例如第0个节点，就直接返回头结点即可
        while (index) { 
            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++;
    }
    
    //在第index个节点前插入， 从0个节点开始计数
    void addAtIndex(int index, int val) {
        LinkedNode* newNode = new LinkedNode(val);
        LinkedNode* cur = _dummyHead;
        if (index >= _size) return;
        if (index < 0) index = 0;
        while (index) {
            index--;
            cur = cur->next;
        }
        newNode->next = cur->next;
        cur->next = newNode;
        _size++;
    }
    
    //删除第index个节点，从0个节点开始计数
    void deleteAtIndex(int index) {
        LinkedNode* cur = _dummyHead;
        if (index >= _size || index < 0) return;
        while (index) {
            index--;
            cur = cur->next;
        }
        LinkedNode* tmp = cur->next;
        cur->next = cur->next->next;
        delete tmp;
        _size--;
    }
    
private:
    int _size;
    LinkedNode* _dummyHead; //虚拟头结点
};

206.反转链表

返回pre，实际推导一下会好一点。就像链表里面的index，可以使用头结点推理一下。

//相当于头插法构造链表
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode* pre = nullptr;
        ListNode* cur = head;
        ListNode* tmp;
        while (cur != nullptr){
            tmp = cur->next;
            cur->next = pre;
            pre = cur;
            cur = tmp
        }
        return pre; //返回的是pre，这里面总是容易搞混乱
    }
};