707. 设计链表

单链表设计，似乎设计为双向链表时间复杂度更低

// class ListNode{
// public:  
//     int val;
//     ListNode *next;
//     ListNode(int x):val(x),next(NULL){}
// };

class MyLinkedList {
public:
    ListNode *head=NULL;
    /** Initialize your data structure here. */
    MyLinkedList() {
        head=new ListNode(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(head==NULL||head->next==NULL)
            return -1;
        ListNode *p=head->next;
        int i=0;
        while(p!=NULL){
            if(i==index){
                return p->val;
            }
            p=p->next;
            ++i;
        }
        return -1;
    }
    
    /** 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) {
        ListNode *node=new ListNode(val);
        node->next=head->next;
        head->next=node;
    }
    
    /** Append a node of value val to the last element of the linked list. */
    void addAtTail(int val) {
        ListNode *p=head;
        while(p->next!=NULL){
            p=p->next;
        }
        ListNode *node=new ListNode(val);
        node->next=p->next;
        p->next=node;
    }
    
    /** 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){
            addAtHead(val);
            return ;
        }
        int i=0;
        ListNode *p=head;
        while(p->next!=NULL){
            if(i==index){
                ListNode *node=new ListNode(val);
                node->next=p->next;
                p->next=node;
            }
            p=p->next;
            ++i;
        }
        if(i==index){
            ListNode *node=new ListNode(val);
            node->next=p->next;
            p->next=node;
        }
    }
    
    /** Delete the index-th node in the linked list, if the index is valid. */
    void deleteAtIndex(int index) {
        int i=0;
        ListNode *p=head;
        while(p->next!=NULL){
            if(i==index){
                p->next=p->next->next;
                return;
            }
            p=p->next;
            ++i;
        }
    }
};

/**
 * 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);
 */

执行用时 : 76 ms, 在Design Linked List的C++提交中击败了80.36% 的用户
内存消耗 : 19.1 MB, 在Design Linked List的C++提交中击败了85.03% 的用户