leetcode 237. Delete Node in a Linked List

/** * 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) {        ListNode * be = node->next;                do{            node->val = be->val;            if(be->next != NULL)                be = be->next, node = node->next;            else break;        }while(true);        node->next= NULL;    }};