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;
*     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;
}
};