力扣-707题设计链表（C++）- 注意index范围

客官°小女子只卖身不卖艺 2022-09-04 09:54 132阅读 0赞

题目链接：[https://leetcode-cn.com/problems/design-linked-list/][https_leetcode-cn.com_problems_design-linked-list]  
题目如下：  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwNDY3Njcw_size_16_color_FFFFFF_t_70]

class MyLinkedList {
        
    public:
        //注意：index从0开始
        /** Initialize your data structure here. */
        struct ListNode{
        
            int val;
            ListNode* next;
            ListNode(int x):val(x),next(NULL){
        }
        };
        MyLinkedList() {
        
            m_dummyHead=new ListNode(0);//此为虚拟头节点，而非head节点
            m_size=0;
        }
        
        void print(ListNode* head){
        
            while(head!=NULL){
        
                cout<<head->val<<',';
                head=head->next;
            }
            cout<<endl;
        }
        /** 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||index>(m_size-1)) return -1;
    
            ListNode* cur=m_dummyHead->next;
    
            while(index--){
        
                cur=cur->next;
            }
            print(m_dummyHead);
    
            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) {
        
            ListNode* node=new ListNode(val);
            node->next=m_dummyHead->next;
            m_dummyHead->next=node;
            m_size++;
        }
        
        /** Append a node of value val to the last element of the linked list. */
        void addAtTail(int val) {
        
            ListNode* node=new ListNode(val);
            ListNode* cur=m_dummyHead;
    
            while(cur->next!=NULL){
        
                cur=cur->next;
            }
    
            cur->next=node;
            m_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||index>m_size) return ;//index从0开始
    
            ListNode* node=new ListNode(val);
            ListNode* cur=m_dummyHead;
    
            while(index--){
        
                cur=cur->next;
            }
    
            node->next=cur->next;
            cur->next=node;
            m_size++;
    
        }
        
        /** Delete the index-th node in the linked list, if the index is valid. */
        void deleteAtIndex(int index) {
        
            if(index<0||index>=m_size) return ;
    
            ListNode* cur=m_dummyHead;
            while(index--){
        
                cur=cur->next;
            }
    
            ListNode* temp=cur->next;
            cur->next=cur->next->next;
            delete temp;
            m_size--;
    
            
        }
    
    private:
        int m_size;
        ListNode* m_dummyHead;
    };
    
    /**
     * 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);
     */

[https_leetcode-cn.com_problems_design-linked-list]: https://leetcode-cn.com/problems/design-linked-list/
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwNDY3Njcw_size_16_color_FFFFFF_t_70]: /images/20220829/034f3a54b6e647b08eb966961057946f.png