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.

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:

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

方法1:

思路：

这道题完全没有给除了目标节点以外的任何参数，必须通过修改val的值来实现删除节点。

易错点：

1. 需要一个prev：因为最后的循环终止时，node已经指向了最后一个节点，必须同时记录一个 并且令prev -> next = nullptr来去掉末位节点。

class Solution {
public:
    void deleteNode(ListNode* node) {
        if (!node) return;
        ListNode* prev = nullptr;
        while (node -> next){
            node -> val = node->next ->val;
            prev = node;
            node = node -> next;
        }
        prev->next = nullptr;        
        return;
    }
};