代码随想录算法训练营day 3 | Leetcode 203 707 206

day 3 主要学习链表

链表是一种通过指针串联在一起的线性结构，在内存空间不是连续存储的。单链表包括一个值value，以及指向下一个节点的指针。单链表头节点为head，尾节点指向nullptr。

Leetcode 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) {
        // 删除头节点
        while (head != nullptr && head->val == val) {
            ListNode* tmp = head;
            head = head->next;
            delete tmp;
        }
        // 删除非头节点
        ListNode* cur = head;
        while (cur != nullptr && cur->next != nullptr) {
            if (cur->next->val == val) {
                ListNode* tmp = cur->next;
                cur->next = cur->next->next;
                delete tmp;
            } else {
                cur = cur->next;
            }
        }
        return head;
    }
};

方法二 

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

Leetcode 707 设计链表

这里主要注意掌握链表的几种操作，包括定义、查询、插入（在头、中间、尾）、删除。

class MyLinkedList {
public:
    struct LinkedNode {
        int val;
        LinkedNode* next;
        LinkedNode(int val): val (val), next(nullptr) {}
    };

    MyLinkedList() {
        dommyHead = new ListNode(0);
        _size = 0;
    }

    int get(int index) {
        if (index > _size - 1) {
            return -1;
        }

        ListNode* cur = dommyHead->next;
        while (index--) {
            cur = cur->next;
        }

        return cur->val;
        
    }

    void addAtHead(int val) {
    ListNode* cur = new ListNode(val);
    cur->next = dommyHead->next;
    dommyHead->next = cur;
    _size++;
    }

void addAtTail(int val) {
    ListNode* cur = dommyHead;
    ListNode* tailNode = new ListNode(val);
    while (cur->next != nullptr) {
        cur = cur->next;
    }
    cur->next = tailNode;
    _size++;
}

void addAtIndex(int index, int val) {
    if(index > _size) return;
    ListNode* cur = dommyHead;
    ListNode* newNode = new ListNode(val);
    while(index--){
        cur = cur -> next;
    }
    newNode -> next = cur -> next;
    cur -> next = newNode;
    _size++;

}

void deleteAtIndex(int index) {
    if(index >= _size) return;
    ListNode* cur = dommyHead;
    while(index--){
        cur = cur -> next;
    }
    ListNode* tmp = cur -> next;
    cur -> next = cur -> next -> next;
    delete tmp;
    tmp = nullptr;
    _size--;

}
private:
    ListNode* dommyHead;
    int _size;
}
;

/**
 * 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);
 */

Leetcode 206 翻转链表

有双指针和递归两种方法，两种方法类似。一个指针cur指向当前的节点，一个指针指向前一个节点，设置一个保留当前节点的tmp。

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

    }
};