题目：

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 -> 4after calling your function.

题解：

　　无法获得目标节点的上一节点，只能复制下一节点，然后删除掉

Solution 1 ()

class Solution {
public:
    void deleteNode(ListNode* node) {
        ListNode *p = node->next;
        node->val = p->val;
        node->next = p->next;
        delete p;   
    }
};

　　　还有结构体赋值操作（我是这么理解的） *node = *node->next 等价于node->val = node->next->val；node->next = node->next->next;

Solution 2 ()

class Solution {
public:
    void deleteNode(ListNode* node) {
        auto next = node->next;
        *node = *next;
        delete next;  
    }
};

【LeetCode】237. Delete Node in a Linked List