LeetCode237. 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.

Given linked list -- head = [4,5,1,9], which looks like following:

 

Example 1:

Input: head = [4,5,1,9], node = 5
Output: [4,1,9]
Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.

Example 2:

Input: head = [4,5,1,9], node = 1
Output: [4,5,9]
Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.

 

Note:

• The linked list will have at least two elements.
• All of the nodes' values will be unique.
• The given node will not be the tail and it will always be a valid node of the linked list.
• Do not return anything from your function.

思路：

这道题虽然简单，但是也有一个点需要注意，就是传进来的是原指针的拷贝，所以我们只能改变该指针指向的内容，直接改变该指针是没有用的，代码如下：

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

当然，还有一个笨一点的方法，就是一个一个接着拷贝下去：

class Solution {
public:
    void deleteNode(ListNode* node) {
        ListNode *pre = NULL;
        while(node->next){
            pre = node;
            node->val = node->next->val;
            node = node->next;
        }
        pre->next = NULL;
    }
};