LeetCode 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.

 //编写一个函数删除单链表中（除末尾节点外）的一个节点，只提供待删除节点。
//假如链表是1 -> 2 -> 3 -> 4 给你第3个节点，值为3，则调用你的函数后链表为1 -> 2 -> 4
struct ListNode{
	int val;
	ListNode *next;
	ListNode(int x) :val(x), next(NULL){}
};
class Solution {
public:
	void deleteNode(ListNode* node){
		if (node == NULL) return;
		node->val = node->next->val;
		node->next = node->next->next;
	}
};