Day03 203. 移除链表元素 707. 设计链表 206. 反转链表

203. 移除链表元素

https://leetcode.cn/problems/remove-linked-list-elements/

虚拟头结点

/**
 * 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* dummy = new ListNode(0);
        dummy->next = head;
        ListNode* p = dummy;
        while(p->next){
            if (p->next->val == val){
                p->next = p->next->next;
            }
            else p = p->next;
        }
        return dummy->next;
    }
};

707.设计链表

https://leetcode.cn/problems/design-linked-list/
要操作第n个结点，一定要让cur->next是第n个结点，这样才能用cur操作第n个结点
插入结点时先修改后一条边，再修改前一条边
是否要添加虚拟头结点 ：
虚拟头结点的主要目的是为了避免对头结点的特殊处理；这个处理就指的是修改操作。所以可以这样：涉及到对链表修改(如插入，删除，移动)的，都加个dummy，只是遍历取点就可以不用加

class MyLinkedList {
public:
    struct ListNode{
        int val;
        ListNode* next;
        ListNode(int val): val(val), next(NULL){}
    };
    MyLinkedList() {
        size = 0;
        dummy = new ListNode(0);
    }
    
    int get(int index) {
        if (index < 0 || index >= size) return -1;
        ListNode* cur = dummy->next;
        while (index --){
            cur = cur->next;
        }
        return cur->val;
    }
    
    void addAtHead(int val) {
        ListNode* p = new ListNode(val);
        p->next = dummy->next;
        dummy->next = p;
        size++;
    }
    
    void addAtTail(int val) {
        ListNode* p = new ListNode(val);
        ListNode* cur = dummy;
        while(cur->next){
            cur = cur->next;
        }
        cur->next = p;
        size++;
    }
    
    void addAtIndex(int index, int val) {
        if(index < 0 || index > size) return;
        ListNode* p = new ListNode(val);
        ListNode* cur = dummy;
        while(index--){
            cur = cur->next;
        }
        p->next = cur->next;
        cur->next = p;
        size++;
    }
    
    void deleteAtIndex(int index) {
        if(index < 0 || index >=size) return;
        ListNode* cur = dummy;
        while(index--){
            cur = cur->next;
        }
        cur->next = cur->next->next;
        size--;
    }
private:
    int size;
    ListNode* dummy;
};

206.反转链表

https://leetcode.cn/problems/reverse-linked-list/

双指针

要把 cur->next 结点用tmp指针保存一下，接下来反转后可以通过tmp找到下一个需要操作的结点
反转后先修改pre，再修改cur，注意顺序

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