【数据结构入门_链表】 Leetcode 203. 移除链表元素

原题连接：Leetcode 203. Remove Linked List Elements

Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head.

Example 1:

Input: head = [1,2,6,3,4,5,6], val = 6
Output: [1,2,3,4,5]

Example 2:

Input: head = [], val = 1
Output: []

Example 3:

Input: head = [7,7,7,7], val = 7
Output: []

Constraints:

• The number of nodes in the list is in the range [0, 10⁴].
• 1 <= Node.val <= 50
• 0 <= val <= 50

---

做法一：迭代

思路：

遍历一遍链表，将重复元素删除
记得用虚拟头结点，好用

c++代码：

/**
 * 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) {
        // prehead虚拟头结点 prev指向虚拟头结点的指针
        ListNode* prehead = new ListNode(-1);
        ListNode* prev = prehead;
        prehead->next = head;

        while(prev->next != nullptr){
            if(prev->next->val == val){
                prev->next = prev->next->next;
            }
            prev = prev->next;
        }
    
        return prehead->next;
    }
};

复杂度分析：

• 时间复杂度：O(n)，需要遍历整个链表的元素
• 空间复杂度：O(1)，常数个辅助变量