[leetcode] 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.

题目大意：删除链表的一个节点，尾节点除外

/**
* Definition for singly-linked list.
* struct ListNode {
*     int val;
*     struct ListNode *next;
* };
*/
void deleteNode(struct ListNode* node) {

{
node->val = node->next->val;
node->next = node->next->next;
}

}

这应该是代码量最少的一道题了，两行代码