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.

Analyse: we first set the value of want-to-delete-node as the value of the next node to it, then ignore the next node and point its next to the next next node of it.

Runtime: 16ms.

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9 class Solution {
10 public:
11     void deleteNode(ListNode* node) {
12         node->val = node->next->val;
13         ListNode* temp = node->next;
14         node->next = node->next->next;
15         delete temp;
16     }
17 };

Delete Node in a Linked List

原文：http://www.cnblogs.com/amazingzoe/p/4768301.html