力扣刷题 14.移除链表元素——简单题

/**
 * 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) {}
 * };
 */
 //**解法1：**新插入一个头结点，记录要删除节点的上一个节点的位置，当发现要删除的节点时，mov不能移动，否则就追上了current指针，故使用flag标志位，表示mov指针能否移动。
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        if(head == nullptr)
        {
            return nullptr;
        }
        int flag = 1;
        ListNode *current = head;
        ListNode *former = new ListNode(0,head);
        ListNode *mov = former;
        
        while(current)
        {
            if(current->val == val)
            {
                flag = 0;
                mov->next = current->next;
            }
            if(flag)
            {
                mov = mov->next;
            }
            current = current->next;
            flag = 1;
        }

        return former->next;
    }
};
//**解法2：**（转载：https://blog.csdn.net/sweetorange_/article/details/119750777）
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        while(head != NULL && head->val == val)
        {
        	head = head ->next;
        }
        ListNode* cur = head;
        while((cur != NULL )&& (cur->next != NULL))
        {
            if(cur ->next ->val == val)
            {
                cur -> next = cur -> next -> next;
            }
            else
            {
                cur = cur -> next;
            }
        }
        return head;
    }
};