15算法课程 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 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.

solution:

删除一个节点，一般是找到其前驱结点，而此题无法获取前驱节点，就只好将后继节点的值复制给当前节点，然后删除后继节点

code:

class Solution {
public:
void deleteNode(struct ListNode* node) {
struct ListNode *aft = node->next ;
node->val = aft->val;
node->next = aft->next;
}
};