题目描述：

删除链表中等于给定值 val 的所有节点。

示例:

    输入: 1->2->6->3->4->5->6, val = 6
    输出: 1->2->3->4->5

解法：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        ListNode* cur = NULL;
        while(head && head->val == val){
            cur = head;
            head = head->next;
            delete cur;
        }
        
        cur = head;
        ListNode* nxt = NULL;
        if(head){
            nxt = head->next;
        }
        while(nxt){
            // cout<<nxt->val<<endl;
            if(nxt->val == val){
                cur->next = nxt->next;
                delete nxt;
                nxt = cur->next;
            }else{
                cur = nxt;
                nxt = nxt->next;
            }
        }
        return head;
    }
};

leetcode 203. 移除链表元素(Remove Linked List Elements)

原文：https://www.cnblogs.com/zhanzq/p/10566059.html