【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==0) return;
        if(node->next==0) return;
        node->val = node->next->val;
        node->next = node->next->next;
}