Domanda di colloquio di Bloomberg
Reverse a singly linked list.
Risposta di colloquio
Anonimo
23 gen 2015
node* reverseLL(node * head){ node* next = head; node* prev = NULL; while(next){ head = next; next = next->next; head->next = prev; prev= head; } return head; }