代码随想录算法训练营第三天 |203.移除链表元素；707.设计链表；206.反转链表

203.移除链表元素:力扣（LeetCode）官网 - 全球极客挚爱的技术成长平台

/**
 * 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) {
        while(head!=NULL&&head->val==val){
            ListNode* tmp = head;
            head=head->next;
            delete tmp;
        }
        ListNode* cur = head;
        while(cur!=NULL&&cur->next!= NULL){
            if(cur->next->val==val){
                ListNode* tmp = cur->next;
                cur->next = cur->next->next;
                delete tmp;
            }else{
                cur = cur->next;
            }
        }
        return head;
    }
};

好久不写链表了有点不熟悉；

采用虚拟头节点的方法：

class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        ListNode* dummyHead = new ListNode(0);
        dummyHead->next = head;
        ListNode* cur = dummyHead;
        while(cur->next!=NULL){
            ListNode* tmp = cur->next;
            if(cur->next->val == val){
                cur->next = cur->next->next;
                delete(tmp);
            }else{
                cur = cur->next;
            }
        }
        head = dummyHead->next;
        delete dummyHead;
        return head;
    }
};

707.设计链表：力扣（LeetCode）官网 - 全球极客挚爱的技术成长平台

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<0 ||index>(_size-1)){
            return -1;
        }
        LinkedNode* cur = _dummyHead->next;
        while(index--){
            cur = cur->next;
        }
        return cur->val;
    }
    
    void addAtHead(int val) {
        LinkedNode* NewNode = new LinkedNode(val);
        LinkedNode* cur = _dummyHead;
        NewNode->next = cur->next;
        _dummyHead->next = NewNode;
        _size++;
    }
    
    void addAtTail(int val) {
        LinkedNode* NewNode = new LinkedNode(val);
        LinkedNode* cur = _dummyHead; 
        while(cur->next!=NULL){
            cur = cur->next;
        }
        cur->next = NewNode;
        _size++;
    }
    
    void addAtIndex(int index, int val) {
        if(index<0){
            index = 0;
        }
        if(index>_size) return;
        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* tmp = cur->next;
        cur->next==cur->next->next;
        delete tmp;
        tmp = nullptr;
        _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);
 */

整了半天还是报越界错误，不知道为啥。

206.反转链表：力扣（LeetCode）官网 - 全球极客挚爱的技术成长平台

常规方法，两个指针一个在前一个在后，反转链表。

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