K
Size: a a a
K
РД
K
struct Node {
Node* next = nullptr;
};
Node* reverse(Node* head) {
Node* prev = nullptr;
Node* current = head;
while (current) {
Node* tmp = current->next;
current->next = prev;
prev = current;
if (tmp != nullptr) {
current = tmp;
} else {
break;
}
}
return current;
}
Код сам оптимизируй, я это 4 года назад писалᏃ
struct Node {
Node* next = nullptr;
};
Node* reverse(Node* head) {
Node* prev = nullptr;
Node* current = head;
while (current) {
Node* tmp = current->next;
current->next = prev;
prev = current;
if (tmp != nullptr) {
current = tmp;
} else {
break;
}
}
return current;
}
Код сам оптимизируй, я это 4 года назад писалт