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.

 

解决方法：

 好像题意和给的函数定义出现了不匹配的情况。

 无论如果，注意值和指针的赋值。

代码：

 

void deleteNode(ListNode* node) {
        if (node && node->next){
            node->val = node->next->val;
            node->next =node->next->next;
        }
    }