LeetCode - Delete Node in a Linked List

Question

Link : https://leetcode.com/problems/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.

Code

思路很简单，就是把后一个节点值赋给当前节点，然后删除下一个节点即可。（C++ : 16 ms）

/** * 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->next == NULL)            return;        node->val = node->next->val;        //then delete next node        node->next = node->next->next;    }};