237. 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 is1 -> 2 -> 3 -> 4and you are given the third node with value3, the linked list should become1 -> 2 -> 4after calling your function.


题意：

删除链表指定节点。前提是只传删除节点给函数。但不包括删除尾节点。


思路：

由于没有链表前节点的存在，所以删除链表时无法改变前节点的指向。但是链表值是int型的，所有可以把当前节点的val和下个节点的val交换。然后删除下个节点即可。

/***Definitionforsingly-linkedlist.*structListNode{*intval;*structListNode*next;*};*/voiddeleteNode(structListNode*node){if(node->next==NULL){return;}inttmp=0;tmp=node->val;node->val=node->next->val;node->next->val=tmp;structListNode*list=node->next;node->next=node->next->next;free(list);}