LeetCode: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

思路分析：在链表头节点前插入一个新节点，方便删除操作。

代码：

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