题目：
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 -> 4after calling your function.
首先判断这个结点是不是空结点或尾结点，然后要记得释放内存，以免造成memory leak
/** * 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) { if(!node || !node->next) return; ListNode *delNode; delNode = node->next; node->val = node->next->val; node->next = node->next->next; free(delNode); } };
［LeetCode］ 237. Delete Node in a Linked Lis解题小结
原文：http://www.cnblogs.com/Doctengineer/p/5844120.html