Day3链表

Day3 链表

● 203.移除链表元素

class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        while(head!= nullptr && head->val == val)
        {
            ListNode* temp = head;
            head = head -> next;
            delete temp;
        }
        ListNode* cur = head;
        while(cur!= nullptr && cur->next != nullptr)
        {
            if(cur->next->val == val)
            {
                ListNode* temp = cur->next;
                cur->next = cur->next->next;
                delete temp;
            }
            else 
            {
                cur = cur->next;
            }
        }
        return head;

    }
};

这种办法是考虑头节点是否为所删的数值

class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        ListNode* dhead = new ListNode(0);
        dhead->next = head;
        ListNode* cur = dhead;
        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 = dhead->next;
        delete dhead;
        return head;
    }
};

设计链表

class MyLinkedList {
public:
    struct LinkedNode{
        int val;
        LinkedNode* next;
        LinkedNode(int val):val(val), next(nullptr){}
    };
    MyLinkedList() {
        dhead =new LinkedNode(0);
        size = 0;


    }
    
    int get(int index) {
        if(index<0||index>size-1){
            return -1;
        }
        LinkedNode* cur = dhead->next;
        while(index){
            cur = cur->next;
            index--;
        }
        return cur->val;


    }
    
    void addAtHead(int val) {
        LinkedNode* newnode = new LinkedNode(val);
        newnode->next = dhead->next;
        dhead->next = newnode;
        size++;

    }
    
    void addAtTail(int val) {
        LinkedNode* newnode = new LinkedNode(val);
        LinkedNode* cur = dhead;
        while(cur->next!=NULL){
            cur = cur->next;
        }
        cur->next = newnode;
        size++;


    }
    
    void addAtIndex(int index, int val) {
        if(index > size) return;
        if(index < 0) index = 0; 
        LinkedNode* newnode = new LinkedNode(val);
        LinkedNode* cur = dhead;
        while(index--){
            cur = cur->next;
        }
        newnode->next = cur->next;
        cur->next = newnode;
        size++;

    }
    
    void deleteAtIndex(int index) {
        if (index >= size || index < 0) {
            return;
        }
        LinkedNode* cur = dhead;
        while(index--) {
            cur = cur ->next;
        }
        LinkedNode* tmp = cur->next;
        cur->next = cur->next->next;
        delete tmp;
        size--;

    }
private:
    int size;
    LinkedNode* dhead;

};

206.反转链表
双指针的解法：

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode* cur = head;
        ListNode* pre = NULL;
        while(cur!=NULL){
            ListNode* temp = cur->next;
            cur->next = pre;
            pre = cur;
            cur = temp;
        }
        return pre;

    }
};

递归解法

class Solution {
public:
    ListNode* reverse(ListNode* cur,ListNode* pre){
        if(cur==NULL) return pre;
        ListNode* temp = cur->next;
        cur->next = pre;
        return reverse(temp,cur);
    } 
    ListNode* reverseList(ListNode* head) {
        return reverse(head,NULL);

    }

};