[LeetCode] (easy) 237. Delete Node in a Linked List

 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.

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.

---

 注意到给的仅仅是指向被删除节点的指针，考虑到单链表的特性（无法向前回溯，只能向后修改），因此所给节点的前驱指向所给节点的那个next指针是没法被修改的，即当前节点的内存地址所代表的节点外壳必然要保持在链表中，因此只能修改它的值，即把后继的值提到当前节点，并将后继从链表中移除。这里涉及到的就是链表节点删除中逻辑链表与物理链表的解耦和，很酷

/**
 * 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) {
        node->val = node->next->val;
        node->next = node->next->next;
    }
};