Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Zadanie Dejwu
#include <iostream> class Node { public: Node() = delete; Node(int d) : data{d} { next = nullptr; } Node(int d, Node* ptr) : data{d}, next{ptr} {} static void deleteNode(Node * ptr) { if(ptr == nullptr) return; //tail else if(ptr->next == nullptr) { //previous->next wskazuje na usuniety Node -> UB delete ptr; } //rest else { Node * tmp = ptr->next; ptr->data = tmp->data; ptr->next = tmp->next; delete tmp; } } static void printList(Node * ptr) { while(ptr != nullptr) { std::cout << ptr->data << '\n'; ptr = ptr->next; } } int data; Node *next; }; auto main() ->int { Node* third = new Node(3); Node* second = new Node(2, third); Node* head = new Node(1, second); Node::printList(head); Node::deleteNode(third); std::cout << '\n'; Node::printList(head); }
run
|
edit
|
history
|
help
0
problem_name_1
list iota cout
Linear search
10226
First
Делим на Ноль
Composite pattern
projecte1
Ordered Graphs
insertion sort