[LeedCode OJ]#203 Remove Linked List Elements

/**
 * 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)
		{
			while(head && head->val==val)
				head = head->next;
			ListNode *cur = head;
			ListNode *newlist = new ListNode(0);
			ListNode *ptr = newlist;
			while(cur)
			{
				while(cur && cur->val == val)
					cur = cur->next;
				if(cur==nullptr)
					break;
				ListNode *pnext = cur->next;
				ptr->next = cur;
				cur = pnext;
				ptr = ptr->next;
			}
			ptr->next = nullptr;
			return newlist->next;
		}
};