[Leetcode]设计链表

最新推荐文章于 2023-05-27 16:15:18 发布

原创最新推荐文章于 2023-05-27 16:15:18 发布 · 241 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

数据结构与算法专栏收录该内容

113 篇文章

订阅专栏

本文详细介绍了使用C++实现链表数据结构的方法，包括链表的基本操作如获取节点值、头部插入、尾部插入、指定位置插入及删除节点等。通过具体的代码示例，展示了如何创建链表节点，进行各种链表操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

代码

typedef struct SingleList {
public:	
    int val;
	SingleList* next;
    
};
class MyLinkedList {
public:
    /** Initialize your data structure here. */
    MyLinkedList():_head(new SingleList()) {
      
    }
    
    /** 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->next==nullptr)
            return -1;
        int pos=0;
        auto ptr=_head->next;
        while(ptr!=nullptr)
        {
            if(pos==index)
                return ptr->val;
            else
            {
                ptr=ptr->next;
                pos++;
            }
        }
        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->next==nullptr)
        {
            _head->next=new SingleList();
            _head->next->val=val;
        }else
        {
            auto first=_head->next;
            auto newNode=new SingleList();
            newNode->val=val;
            _head->next=newNode;
            newNode->next=first;
        }
        
    }
    
    /** Append a node of value val to the last element of the linked list. */
    void addAtTail(int val) {
        auto i=_head;
        //找到链表尾部
        while(i->next!=nullptr)
            i=i->next;
        i->next=new SingleList();
        i->next->val=val;
    }
    
    /** 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) {
        int listIndex=0;
        auto ptr=_head;
        while(ptr->next!=nullptr)
        {
            //找到了位置
            if(listIndex==index)
            {
                auto newNode=new SingleList();
                newNode->val=val;
                newNode->next=ptr->next;
                ptr->next=newNode;
                break;
            }
            else
            {
                ptr=ptr->next;
                listIndex++;
            }
                
        }
        if(ptr->next==nullptr&&listIndex==index)
        {
              auto newNode=new SingleList();
              newNode->val=val;
              newNode->next=ptr->next;
              ptr->next=newNode;
                
        }
    }
    
    /** Delete the index-th node in the linked list, if the index is valid. */
    void deleteAtIndex(int index) {
        int listIndex=0;
        auto ptr=_head;
        while(ptr->next!=nullptr)
        {
            //找到了位置
            if(listIndex==index)
            {
                auto delNode=ptr->next;
                //要删除的结点不是空
                if(delNode!=nullptr)
                {
                    ptr->next=delNode->next;
                    delete delNode;
                    break;
                }
                    
            }
            else
            {
                ptr=ptr->next;
                listIndex++;
            }
                
        }
    }
private:
    SingleList*  const _head;
};

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