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.

 

Show Tags

Show Similar Problems

 

 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         if(node==NULL||node->next==NULL)

13           return;

14         ListNode* tmp_node=node->next;

15         

16             node->val=tmp_node->val;

17             node->next=tmp_node->next;

18         delete(tmp_node);

19     }

20 };