leetcode 707 design-linked-list

最新推荐文章于 2022-01-09 23:41:36 发布

weixin_41968820

最新推荐文章于 2022-01-09 23:41:36 发布

阅读量55

点赞数

本文链接：https://blog.csdn.net/weixin_41968820/article/details/86745848

版权

class MyLinkedList {
public:
    
    struct  Node {
        int val;
        Node *next;
        Node(int x) : val(x), next(NULL) {}
    };
    
    Node *head;
    
    /** Initialize your data structure here. */
    MyLinkedList() {
        head = NULL;
    }
    
    /** 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 < 0 || head == NULL) return -1;
        
        int i = 0;
         Node *temp = head;
        
        while(i < index && temp->next != NULL)
        {
            temp = temp->next;
            i++;
            if (i == index) break;
        }
        
        if (i == index) return temp->val;
        else    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) {
        if(!head)
        {   head=new Node(val);}
        else
        {Node *p=new Node(val);
            p->next=head;
            head=p;
        }
    }

    /** Append a node of value val to the last element of the linked list. */
    void addAtTail(int val) {
        if(!head)  head  = new Node(val);

        else
        {
            Node *p=head;
            while(p->next)
            {
                p=p->next;
            }
            Node *tail=new Node(val);
            p->next=tail;
            
        }
    }

    /** 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 ;
         if (head == NULL)
        {
            if (index > 0)
            { 
                return;
            }
            else
            {
                head = new Node(val);
                return;
            }
        }
         Node *p=head;
        Node *last = NULL;
        int count=0;
        while(count<index&&p->next!=NULL)
        {
            last=p;
            count++;
            p=p->next;
            if(count==index) break;
           
        }
        if(count==index)
        {
            if(count==0)
                addAtHead(val);
            else
            {
                Node *tmp=new Node(val);
                last->next=tmp;
                tmp->next=p;
                
            }
         }    else if (count==index-1)
            {
                 Node *tail=new Node(val);
                 p->next=tail;
            }
        
    }

    /** Delete the index-th node in the linked list, if the index is valid. */
    void deleteAtIndex(int index) {
         if(index<0 && head == NULL)return ;
        if(index==0&&head!=NULL)
            head=head->next;
        Node *p=head;
        Node *last = NULL;
        int count=0;
        while(count<index&&p->next!=NULL)
        {
            last=p;
            count++;
            p=p->next;
            if(count==index) break;
        }
        if(count==index)   
        {
            last->next=p->next;
        }
       
         
    }
       
};

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