代码随想录打卡

学习目标：

● 链表理论基础
● 203.移除链表元素
● 707.设计链表
● 206.反转链表

---

学习内容：

203.移除链表元素：设置虚拟头结点防止头节点被删

学习时间：

2022年10月28日

---

学习产出：

203.移除链表元素

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        ListNode* dummyhead = new ListNode(0);
        dummyhead->next=head;
        ListNode* cur = dummyhead;
        while(cur->next!=NULL){
            if(cur->next->val==val){
                ListNode* temp = cur->next;               
                cur->next=cur->next->next;
                delete temp;
            }
            else{
                cur=cur->next;
            }
        }
        head=dummyhead->next;
        delete dummyhead;
        return head;
    }
};

707.设计链表

class MyLinkedList {
public:
    struct LinkedNode{
        int val;
        LinkedNode* next;
        LinkedNode(int val):val(val),next(NULL){}
    };
    MyLinkedList() {
        dummyhead=new LinkedNode(0);
        size = 0;
    }
    
    int get(int index) {
        if(index>=size||index<0) return -1;
        LinkedNode* cur = dummyhead->next; 
        while(index--){
            cur=cur->next;
        }
        return cur->val;
    }
    
    void addAtHead(int val) {
        LinkedNode* newhead = new LinkedNode(val);
        newhead->next=dummyhead->next;
        dummyhead->next=newhead;
        size++;
    }
    
    void addAtTail(int val) {
        LinkedNode* temp = dummyhead;
        LinkedNode* endhead = new LinkedNode(val);
        while(temp->next!=NULL){
            temp=temp->next;
        }
        temp->next=endhead;
        size++;
    }
    
    void addAtIndex(int index, int val) {
        if(index>size||index<0) return;
        else{
            LinkedNode* temp = dummyhead;
            LinkedNode* newnode = new LinkedNode(val); 
            while(index--){
                temp=temp->next;
            }
            newnode->next=temp->next;
            temp->next=newnode;
            size++;
        }
    }
    
    void deleteAtIndex(int index) {
        if(index>=size||index<0) return;
        else{
            LinkedNode* cur = dummyhead;
            while(index--){
                cur=cur->next;
            }
            LinkedNode* temp = cur->next;
            cur->next=cur->next->next;
            delete temp;
            size--;
        }
    }
private:
    int size;
    LinkedNode* 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);
 */

翻转链表

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode* pre = nullptr;
        ListNode* cur = head;
        ListNode* temp;
        while(cur!=nullptr){
            temp=cur->next;
            cur->next=pre;
            pre=cur;
            cur=temp;
        }
        return pre;
    }
};