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* pre;
        ListNode* current = node;
        while(current->next) {
            pre = current;
            current = current->next;
            pre->val = current->val;
        }
        pre->next = nullptr;
    }
};