LeetCode Delete Node in a Linked List

Posted 2020-06-30

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.

 

Subscribe to see which companies asked this question

 

这个题目要看清题意，是把函数参数中的这个节点删除，那样就很简单了，将其后继结点的值赋给这个结点，将后继结点的后继赋给这个结点的后继

 

/**
 * 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;
    }
};