Delete Node in a Linked List 单链表删除节点

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;
        node->next=node->next->next;
    }
};