[leetcode-237]Delete Node in a Linked List(C语言)

问题描述：
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.

解析：这道题跟以往的删除节点不大一样，以往是通过找到Prev节点，然后将prev的next指向待删除节点的next信息。但是本题没有给出list的头，而只有当前节点的信息。所有只能删除下一个节点，而将下个节点的信息保存在当前节点中。

void deleteNode(struct ListNode* node) {
   if(node==NULL)
      return;
    node->val = node->next->val;
    node->next = node->next->next;
}