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.
Subscribe to see which companies asked this question
c++ code:
/**
* 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(NULL == node) return;
ListNode *tmp = node->next;
node->val = tmp->val;
node ->next = tmp->next;
delete tmp;
}
};LeetCode:Delete Node in a Linked List
原文：http://blog.csdn.net/itismelzp/article/details/51510212