刷题-Leetcode-707. 设计链表(链表)

707. 设计链表

题目链接

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/design-linked-list/submissions/
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

题目描述

题目分析

使用单链表。
设置一个虚拟头结点。
如出现某一个函数报错不一定是当前函数的问题，可能是其他函数的问题，不要局限在当前函数里找。

class MyLinkedList {
public:
    struct LinkedNode{
        int val;
        LinkedNode* next;
        LinkedNode(int val):val(val),next(nullptr){}
    };//别忘了分号！！
    /** Initialize your data structure here. */
    MyLinkedList() {
        _dummy = new LinkedNode(0);
        _size = 0;
    }
    
    /** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
    int get(int index) {
        //注意index的范围
        if(index < 0 || index > (_size - 1) || index < 0){
            return -1;
        }
        LinkedNode *cur = _dummy->next;
        while(index--){
            cur = cur->next;
        }
        return cur->val;
    }
    
    /** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
    void addAtHead(int val) {
        LinkedNode *newNode = new LinkedNode(val);
        //这两步不能反！！！
        newNode->next = _dummy->next;
        _dummy->next = newNode;
        _size++;
    }
    
    /** Append a node of value val to the last element of the linked list. */
    void addAtTail(int val) {
        LinkedNode *newNode = new LinkedNode(val);
        LinkedNode *cur = _dummy;
        while(cur->next != nullptr){
            cur = cur->next;
        }
        //此时cur在最后一个位置
        cur->next = newNode;
        _size++;
    }
    
    /** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
    void addAtIndex(int index, int val) {
        if(index > _size) return ;
        LinkedNode *newNode = new LinkedNode(val);
        LinkedNode *cur = _dummy;
        while(index--){
            cur = cur->next;
        }
        //此时cur在index-1位置
        newNode->next = cur->next;
        cur->next = newNode;
        _size++;
    }
    
    /** Delete the index-th node in the linked list, if the index is valid. */
    void deleteAtIndex(int index) {
        if(index < 0 || index >= _size) return ;
        LinkedNode *cur = _dummy;
        while(index--){
            cur = cur->next;
        }
        //此时cur在index-1位置
        LinkedNode *tmp = cur->next;
        cur->next = cur->next->next;
        delete tmp;
        _size--;
    }
    private:
        LinkedNode *_dummy;//此题private要放在public后面
        int _size;
};


/**
 * Your MyLinkedList object will be instantiated and called as such:
 * MyLinkedList* obj = new MyLinkedList();
 * int param_1 = obj->get(index);
 * obj->addAtHead(val);
 * obj->addAtTail(val);
 * obj->addAtIndex(index,val);
 * obj->deleteAtIndex(index);
 */