237. Delete Node in a Linked List
Solution
/**
* 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) {
ListNode* temp = node->next;
*node = *temp;
delete temp;
}
};
Complexity
- Time Complexity: O(1).
- Space Complexity: O(1).