<p>Given the <code>head</code> of a linked list and an integer <code>val</code>, remove all the nodes of the linked list that has <code>Node.val == val</code>, and return <em>the new head</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/06/removelinked-list.jpg" style="width: 500px; height: 142px;" />
<pre>
<strong>Input:</strong> head = [1,2,6,3,4,5,6], val = 6
<strong>Output:</strong> [1,2,3,4,5]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> head = [], val = 1
<strong>Output:</strong> []
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> head = [7,7,7,7], val = 7
<strong>Output:</strong> []
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li>The number of nodes in the list is in the range <code>[0, 10<sup>4</sup>]</code>.</li>
	<li><code>1 &lt;= Node.val &lt;= 50</code></li>
	<li><code>0 &lt;= val &lt;= 50</code></li>
</ul>

/**
 * 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) {}
 * };
 */
 static const int __ = [](){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    return 0;
}();
int init = [] {
    ofstream out("user.out");
    cout.rdbuf(out.rdbuf());
    for (string str, val_str; getline(cin, str) && getline(cin, val_str); cout << '\n') {
        int val = stoi(val_str);
        stringstream ss(str); ss.ignore();
        bool first = true;
        cout << '[';
        for (int i; ss >> i; ss.ignore()) {
            if (i != val) {
                if (first) {
                    cout << i;
                    first = false;
                } else {
                    cout << ',' << i;
                }
            }
        }
        cout << ']';
    }
    exit(0);
    return 0;
}(); 

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