LeetCode Q203: Remove Linked List Elements

Remove all elements from a linked list of integers that have value val.

Example
Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
Return: 1 --> 2 --> 3 --> 4 --> 5

Solution:

	/**
	* 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) {
	if(head==NULL)
	return head;
	ListNode* newHead=new ListNode(0);
	newHead->next=head;
	ListNode* p=newHead;
	while(p!=NULL){
	if(p->next!=NULL&&p->next->val==val){
	p->next=p->next->next;
	continue;
	}
	p=p->next;
	}
	p=newHead->next;
	delete newHead;
	return p;
	}
	};

view raw Q203.cpp hosted with ❤ by GitHub