[LeetCode]237. Delete Node in a Linked List

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.

---

// 将下一个节点的值复制过来，然后删除下一个节点
// 题目明确规定不是尾节点
/**
 * 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) {
        if(node == NULL)
            return;
        // 题目已经明确不是尾节点
        node->val = node->next->val;
        ListNode* delNode = node->next;
        node->next = node->next->next;
        delete delNode;
    }
};