LeetCode链表的增删改查

203. 移除链表元素

方法：单链表（用虚拟头节点）

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

$时间复杂度O(n),空间复杂度O(1)

不要虚拟头节点

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;
    }
};

$时间复杂度O(n),空间复杂度O(1)

707. 设计链表

方法：单链表

class MyLinkedList {
public:
    struct linkedList{
        int val;
        linkedList* next;
        linkedList(int val): val(val), next(nullptr){}
    };
    MyLinkedList() {
        _dummyHead = new linkedList(0);
        _size = 0;
    }
    
    int get(int index) {
        if(index > _size-1 || index < 0) return -1;
        linkedList* cur = _dummyHead->next;
        while(index--) cur = cur->next;
        return cur->val;
    }
    
    void addAtHead(int val) {
        linkedList* newNode = new linkedList(val);
        newNode->next = _dummyHead->next;
        _dummyHead->next = newNode;
        _size++;
    }
    
    void addAtTail(int val) {
        linkedList* newNode = new linkedList(val);
        linkedList* cur = _dummyHead;
        while(cur->next != nullptr) cur = cur->next;
        cur->next = newNode;
        _size++;        
    }
    
    void addAtIndex(int index, int val) {
        if(index > _size) return;
        if(index < 0) index = 0;
        linkedList* newNode = new linkedList(val);
        linkedList* cur = _dummyHead;
        while(index--) cur = cur->next;
        newNode->next = cur->next;
        cur->next = newNode;
        _size++;        
    }
    
    void deleteAtIndex(int index) {
        if(index < 0 || index >= _size) return;
        linkedList* cur = _dummyHead;
        while(index--) cur = cur->next;
        linkedList* tmp = cur->next;
        cur->next = cur->next->next;
        delete tmp;
        _size--; 
    }
private:
    linkedList* _dummyHead;
    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);
 */

$时间复杂度O(n),空间复杂度O(1)

206. 反转链表

方法：单链表

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;
    }
};

$时间复杂度O(n),空间复杂度O(1)