【LeetCode】237 - 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.

Hide Tags: 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 class Solution {
10 public:
11     void deleteNode(ListNode* node) {
12         ListNode *cur=node;
13         ListNode *post=node->next;
14         while(true){
15             cur->val=post->val;
16             if(post->next==NULL){
17                 cur->next=NULL;
18                 return;
19             }else{
20                 cur=post;
21                 post=post->next;
22             }
23         }
24     }
25 };