LeetCode 707. Design Linked List

707. Design Linked List

在这道题翻船了（；´д｀）ゞ
我太垃圾了，晚上二刷。

二刷

卡壳？

为什么翻船了呢，看下面代码：

struct node{
    int val;
    node* next;
}
class link{
public:
    link()
    {
        dummy = new node();
        dummy->val = -1;
        dummy->next =NULL;
        size = 0;
    }
private:
    node* dummy;
    int size;
}
int main()
{
    link* test = new link();
    link test2; 
}

上面创建的test和test2都是使用我创建的构造函数。但是在执行完构造函数后，dummy居然是NULL，size(忘了)。等我学了Valgrind。再来看这个问题

刷题报告

class node {
public:
    int val;
    node* next;
    node(int VAL) {
        this->val = VAL;
        next = NULL;
    }
};
class MyLinkedList {
public:
    /** Initialize your data structure here. */
    MyLinkedList() {
        head = NULL;
        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) {
        if (index >= size)
            return -1;
        node* walk=head;
        while (index-- > 0)
            walk = walk->next;
        return walk->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) {
        node* NewNode = new node(val);
        NewNode->next = head;
        head = NewNode;
        size++;
    }

    /** Append a node of value val to the last element of the linked list. */
    void addAtTail(int val) {
        return addAtIndex(size, val);
    /*  node* NewNode = new node(val);
        if (size == 0)
            return addAtHead(val);
        else {
            node* walk=head;
            for (int i = 1; i < size; i++)
                walk = walk->next;
            walk->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 == 0)
            return addAtHead(val);
        else if (index > size)
            return;
        else {
            node* NewNode = new node(val);
            node* walk = head;
            for (int i = 1; i < index; i++)
                walk = walk->next;
            NewNode->next = walk->next;
            walk->next = NewNode;
            size++;
        }
    }
    /** Delete the index-th node in the linked list, if the index is valid. */
    void deleteAtIndex(int index) {
        if (index >= size)
            return;
        else if (index == 0) {
            node* dele = head;
            head = head->next;
            delete dele;
        }
        else {
            node* walk = head;
            while (index-- > 1)
                walk = walk->next;
            node* dele = walk->next;
            walk->next = dele->next;
            delete dele;
        }
        size--;
    }
private:
    node* head;
    int size;
};