Delete Node in a Linked List

题目：Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.
题目要求，删除的节点不是尾节点，说明链表至少有2个节点，函数给出的是删除的那个节点。

void deleteNode(struct ListNode* node) {
  //at least two node
 struct ListNode *p1;
  p1 = node->next;
  node->val = p1->val;  //将要删除节点的下一个节点的值拷贝到删除节点
  node->next = p1->next; //删除节点的下一个节点为删除节点的下下个节点。
  free(p1); //释放删除节点的后一个节点。
}

解题思路：将删除节点的下一个节点的值拷贝到删除节点，删除掉被删除节点的下一个节点。删除节点被下一个节点替换了。