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;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void deleteNode(ListNode* node) {
node->val=node->next->val;
node->next=node->next->next;
}
};