class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
if(head == NULL) return NULL;
ListNode* res = new ListNode(val+1);
res->next = head;
ListNode* ans = res;
while(res->next != NULL){
if(res->next->val == val){
res->next = res->next->next;
}
else{
res = res->next;
}
}
return ans->next;
}
};