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.
Supposed the linked list is1 -> 2 -> 3 -> 4and you are given the third node with value3, the linked list should become1 -> 2 -> 4after calling your function.
Thoughts:
Copy the node value of the next node to the current node
Optional: free the next node
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) {
*node = *node->next;
}
};Code (freeing space)
Code (Java / C#)
Code (Python)
Code (JavaScript)
Code (Ruby)
Special Thanks to stefanpochmann's solution for the reference
Last updated
Was this helpful?