移除链表元素

题目描述：

给你一个链表的头节点 head 和一个整数 val ，请你删除链表中所有满足 Node.val == val 的节点，并返回 新的头节点 。

示例 1：
输入：head = [1,2,6,3,4,5,6], val = 6
输出：[1,2,3,4,5]

示例 2：

输入：head = [], val = 1
输出：[]

示例 3：

输入：head = [7,7,7,7], val = 7
输出：[]

struct ListNode 
 {
     int val;
     struct ListNode *next;
 };

struct ListNode* removeElements(struct ListNode* head, int val) {

	struct ListNode* cur = head;
	struct ListNode* newhead;
	struct ListNode* tail;
	newhead = tail = NULL;

	if (head == NULL)
	{
		return NULL;
	}

	while (cur)
	{
		if (cur->val != val)
		{
			if (tail == NULL)
			{
				newhead = tail = cur;
			}
			else
			{
				tail->next = cur;
				tail = tail->next;
			}
			cur = cur->next;
		}
		else
		{
			struct ListNode* nextnode = cur->next;
			free(cur);
			cur = nextnode;
		}
	}

	if (tail)
		tail->next = NULL;

	return newhead;

}