DAY3: 203移除链表元素 707设计链表 206翻转链表

一、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;//cur目前指向虚拟指针
        while(cur->next!=NULL){
            if(cur->next->val==val){//next->val 指针指向的值
                ListNode* tmp=cur->next;//中间那个被跳过的链表单元
                cur->next=cur->next->next;
                delete tmp;
            }
            else{
                cur=cur->next;
            }
        }
        head=dummyHead->next;
        delete dummyHead;
        return head;
    }
};

二、707设计链表：边界情况的处理 =size-1/ >size/ >=size ?why?

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){//什么时候更新了size？初始值是0
            return -1;
        }
        LinkedNode* cur= dummyHead->next;
        while(index){
            cur=cur->next;
            index--;
        }
        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 ||index<0){//为什么是size?不是size-1
            return; //why return?
        }
        LinkedNode*newNode=new LinkedNode(val);
        LinkedNode*cur=dummyHead;//若cur=dummyHead-1 则在index为cur
        while(index){
            cur=cur->next;
            index--;
        }
        newNode->next=cur->next;
        cur->next=newNode;
        size++;
    }
    
    void deleteAtIndex(int index) {
        if(index>=size ||index<0){//why >=size?
            return;
        }
        LinkedNode* cur=dummyHead;
        while(index){
            cur=cur->next;
            index--;
        }
        LinkedNode *tmp=cur->next;
        cur->next=cur->next->next;
        delete tmp;
        size--;
    }

    void printLinkedList(){
        LinkedNode*cur=dummyHead;
        while(cur->next!=nullptr){
            cout<<cur->next->val<<" ";
            cur=cur->next;
        }
        cout<<endl;
    }
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);
 */

三、206翻转链表：双指针法

/**
 * 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 *temp;
        ListNode *pre=nullptr;
        ListNode *cur=head;
        while(cur!=nullptr){
            temp=cur->next;
            cur->next=pre;
            pre=cur;
            cur=temp;
        }
        return pre;

    }
};