算法训练营day3

题目部分

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* front = new ListNode(0,head);
        ListNode* cur = front;
        while(cur->next!=nullptr){
            if(cur->next->val == val){
                ListNode* temp = cur->next;
                cur->next = temp->next;
                delete temp;
            }else{
                cur = cur->next;
            }
        }
        head = front->next;
        delete front;
        return head;

    }
};

下面是不利用额外空间的解法，先处理头结点，然后把头结点当成跟上面一样的虚拟头结点处理其他全部

class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        // 删除头结点
        while (head != NULL && head->val == val) { // 注意这里不是if
            ListNode* tmp = head;
            head = head->next;
            delete tmp;
        }

        // 删除非头结点
        ListNode* cur = head;
        while (cur != NULL && cur->next!= NULL) {//这里cur !=null是为了怕前面全部删完了
            if (cur->next->val == val) {
                ListNode* tmp = cur->next;
                cur->next = cur->next->next;
                delete tmp;
            } else {
                cur = cur->next;
            }
        }
        return head;
    }
};

707.设计链表

有点小难因为不太熟悉，看了一遍写还是出了点问题，添加头和添加尾的时候都写错了些

class MyLinkedList {
public:
    struct LinkedNode {
        int val;
        LinkedNode* next;
        LinkedNode(int val):val(val), next(nullptr){}
    };
    MyLinkedList() {
        _dummyhead = new LinkedNode(0);
        _size = 0;
    }
    
    int get(int index) {
        if (index > (_size - 1) || index < 0) {
            return -1;
        }
        LinkedNode* cur = _dummyhead->next;
        while(index--){
            cur = cur->next;
        }
        return cur->val;
    }
    
    void addAtHead(int val) {
        LinkedNode* newNode = new LinkedNode(val);
        newNode->next = _dummyhead->next;
        _dummyhead->next = newNode;
        _size++;
    }
    
    void addAtTail(int val) {
        LinkedNode* newNode = new LinkedNode(val);
        LinkedNode* cur = _dummyhead;
        while(cur->next != nullptr){
            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 = _dummyhead;
        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 = _dummyhead;
        while(index--)cur = cur->next;
        LinkedNode* temp = cur->next;
        cur->next=cur->next->next; 
        delete temp;
        temp=nullptr;
        _size--;      
    }
private:
    int _size;
    LinkedNode* _dummyhead;
};

206.反转链表

看了下视频，然后一次过了双指针

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

方法2用递归，递归直接想不好想，但是可以由双指针改编过来，所以建议先写个双指针的，或者构思完双指针再直接写递归

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

    }
};