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

Solution:

#include <iostream>

using namespace std;

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
    void deleteNode(ListNode* node) {

        if ( node == NULL )
            return;

        if ( node->next == NULL ){
            delete node;
            node = NULL;
            return;
        }

        node->val = node->next->val;
        ListNode* delNode = node->next;
        node->next = delNode->next;

        delete delNode;

        return;
        
    }
};

总结： 这道题有点特殊，函数没有给头结点，只给你当前结点，导致无法知道当前结点的前一个结点，所以采用赋值的方法（特殊情况，链表题一般不能赋值）。