问题描述:
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;
}
总结:由于是个单向链表,无法得到被删结点上一个结点的地址,所以直接将被删结点下一个结点的内容赋给被删结点。