Day3 | LeetCode 203. 移除链表元素 707. 设计链表 206. 反转链表

LeetCode 203. 移除链表元素

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

LeetCode 707. 设计链表

class MyLinkedList {
public:
    struct LinkedNode {
        int val;
        LinkedNode* next;
        LinkedNode(int data) {
            this->val = data;
            this->next = nullptr;
        }
    };

    //虚拟头节点
    LinkedNode* head;
    int size;


    MyLinkedList() {
        head = new LinkedNode(0);
        size = 0;
    }

    int get(int index) {
        if (index > size - 1) {
            return -1;
        }
        LinkedNode* cur = head;
        int count = 0;
        for (int i = 0; i <= index; i++) {
            cur = cur->next;
        }
        return cur->val;

    }

    void addAtHead(int val) {
        LinkedNode* newHead = new LinkedNode(val);
        newHead->next = head->next;
        head->next = newHead;
        size++;
    }

    void addAtTail(int val) {
        LinkedNode* newTail = new LinkedNode(val);
        LinkedNode* cur = head;
        while (cur->next != nullptr) {
            cur = cur->next;
        }
        cur->next = newTail;
        size++;
    }

    void addAtIndex(int index, int val) {
        if (index > size) {
            return;
        }
        LinkedNode* newNode = new LinkedNode(val);
        LinkedNode* cur = head;
        for (int i = 0; i < index; i++) {
            cur = cur->next;
        }
        newNode->next = cur->next;
        cur->next = newNode;
        size++;
    }

    void deleteAtIndex(int index) {
        if (index >= size) {
            return;
        }
        LinkedNode* cur = head;
        for (int i = 0; i < index; i++) {
            cur = cur->next;
        }
        LinkedNode* temp = cur->next;
        cur->next = temp->next;
        delete temp;
        size--;
    }
};

LeetCode 206. 反转链表

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode* dummyHead = new ListNode();
        ListNode* cur = head;
        head = nullptr;
        while(cur != nullptr) {
            ListNode* temp = cur->next;
            cur->next = head;
            head = cur;
            cur = temp;
        }
        return head;
    }
};