237. Delete Node in a Linked List

 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 static int wing=[]()
10 {
11     std::ios::sync_with_stdio(false);
12     cin.tie(NULL);
13     return 0;
14 }();
15 
16 class Solution 
17 {
18 public:
19     void deleteNode(ListNode* node) 
20     {
21         if(node==NULL)
22             return;
23         ListNode *next_node=node->next;
24         if(next_node!=NULL)
25         {
26             node->val=next_node->val;
27             node->next=next_node->next;
28         }
29     }
30 };