ListNode1* deleteNode(ListNode1* head, int val)
{
	if (head->val == val)
	{
		head = head->next;
		return head;
	}
	ListNode1 *pCurrentNode = head;
	while (pCurrentNode->next)
	{
		if (pCurrentNode->next->val == val)
		{
			pCurrentNode->next = pCurrentNode->next->next;
		}
		pCurrentNode = pCurrentNode->next;
	}
	return head;
}