[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.

思路：

假如链表1 -> 2 -> 3 -> 4 删除2的时候，可以将2指向4，然后将2的值替换为3的值即可。

/**
 * 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) {
        int next = node->next->val;
        node->val = next;
        node->next = node->next->next;
    }
};