How would you reverse a linked-list?

Question

Utilisateur anonyme · Accepted Answer

http://www.teamten.com/lawrence/writings/reverse_a_linked_list.html

Element *reverse(Element *head)
{
    Element *previous = NULL;

    while (head != NULL) {
        // Keep next node since we trash
        // the next pointer.
        Element *next = head->next;

        // Switch the next pointer
        // to point backwards.
        head->next = previous;

        // Move both pointers forward.
        previous = head;
        head = next;
    }

    return previous;
}

rumberobueno · Answer

Good explanation in the comments.

Harry · Answer

There are detailed analysis and solution in the blog:

http://codercareer.blogspot.com/2011/10/no-18-reverse-linked-list.html

Google

Question d’entretien chez Google

Réponses aux questions d'entretien

Entreprises suivies

Recherche d’emplois