Data-Structures-and-Algorithms/CPP/Leetcode/237-delete-node-in-a-linked-list/237-delete-node-in-a-linked-list.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/CPP/Leetcode/237-delete-node-in-a-linked-list/237-delete-node-in-a-linked-list.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.5 (767 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
/**
 * Definition for singly-linked list.
 * struct ListNode {
 * int val;
 * ListNode *next;
 * ListNode(int x) : val(x), next(NULL) {}
 * };
*/
classSolution {
public:
voiddeleteNode(ListNode* node) {
 ListNode *ptr=node;
swap(ptr->val,ptr->next->val);
 cout << ptr->val;
 ListNode *p2=ptr->next;
 ptr->next=ptr->next->next;
delete(p2);
 }
};