LeetCode:Delete Node in a Linked List

Posted 2020-07-13 walker lee

Delete Node in a Linked List

Total Accepted: 83091 Total Submissions: 189238 Difficulty: Easy

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

Hide Tags

 Linked List

Hide Similar Problems

 (E) Remove Linked List Elements

c++ code:

/**
 * 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) {
        if(NULL == node) return;
        ListNode *tmp = node->next;
        node->val = tmp->val;
        node ->next = tmp->next;
        delete tmp;
    }
};