Skip to content

Instantly share code, notes, and snippets.

@evanpurkhiser

evanpurkhiser/gist:3688271

Forked from RSquaredSoftware/gist:3688255
Created September 10, 2012 01:13
Download ZIP

Revisions

  1. evanpurkhiser revised this gist Sep 10, 2012. 1 changed file with 5 additions and 9 deletions.
    14 changes: 5 additions & 9 deletions gistfile1.cpp
    View file
    Original file line number Diff line number Diff line change
    @@ -1,20 +1,16 @@
    template <typename T>
    void LinkedList<T>::reverseList()
    {
    ListNode<T> *nodePtr;
    nodePtr = head;

    ListNode<T> *previous;
    previous = NULL;

    ListNode<T> *temp;

    while(nodePtr != NULL)
    while(head != NULL)
    {
    temp = nodePtr->next;
    nodePtr->next = previous;
    previous = nodePtr;
    nodePtr = temp;
    temp = head->next;
    head->next = previous;
    previous = head;
    head = temp;
    }

    head = previous;
  2. evanpurkhiser revised this gist Sep 10, 2012. 1 changed file with 7 additions and 12 deletions.
    19 changes: 7 additions & 12 deletions gistfile1.cpp
    View file
    Original file line number Diff line number Diff line change
    @@ -1,26 +1,21 @@
    template <typename T>

    void LinkedList<T>::reverseList()
    {
    ListNode<T> *nodePtr;
    nodePtr = head->next;
    nodePtr = head;

    ListNode<T> *previous;
    previous = head;

    ListNode<T> *temp = nodePtr;
    previous = NULL;

    head->next = NULL;
    ListNode<T> *temp;

    while(nodePtr->next != NULL)
    while(nodePtr != NULL)
    {
    temp = nodePtr->next;

    nodePtr->next = previous;

    previous = nodePtr;
    nodePtr = temp;
    nodePtr = temp;
    }

    head = nodePtr;
    }
    head = previous;
    }
  3. evanpurkhiser revised this gist Sep 10, 2012. 1 changed file with 2 additions and 2 deletions.
    4 changes: 2 additions & 2 deletions gistfile1.cpp
    View file
    Original file line number Diff line number Diff line change
    @@ -12,7 +12,7 @@ void LinkedList<T>::reverseList()

    head->next = NULL;

    while(temp != NULL)
    while(nodePtr->next != NULL)
    {
    temp = nodePtr->next;

    @@ -23,4 +23,4 @@ void LinkedList<T>::reverseList()
    }

    head = nodePtr;
    }
    }
  4. evanpurkhiser revised this gist Sep 10, 2012. 1 changed file with 1 addition and 1 deletion.
    2 changes: 1 addition & 1 deletion gistfile1.cpp
    View file
    Original file line number Diff line number Diff line change
    @@ -18,8 +18,8 @@ void LinkedList<T>::reverseList()

    nodePtr->next = previous;

    nodePtr = previous;
    previous = nodePtr;
    nodePtr = temp;
    }

    head = nodePtr;
  5. evanpurkhiser revised this gist Sep 10, 2012. 1 changed file with 1 addition and 0 deletions.
    1 change: 1 addition & 0 deletions gistfile1.cpp
    View file
    Original file line number Diff line number Diff line change
    @@ -18,6 +18,7 @@ void LinkedList<T>::reverseList()

    nodePtr->next = previous;

    nodePtr = previous;
    previous = nodePtr;
    }

  6. evanpurkhiser revised this gist Sep 10, 2012. 1 changed file with 11 additions and 12 deletions.
    23 changes: 11 additions & 12 deletions gistfile1.cpp
    View file
    Original file line number Diff line number Diff line change
    @@ -1,26 +1,25 @@
    template <typename T>
    void LinkedList<T>::reverseList() {

    ListNode<T> *nodePtr; //to traverse the front
    void LinkedList<T>::reverseList()
    {
    ListNode<T> *nodePtr;
    nodePtr = head->next;

    ListNode<T> *previous; //to traverse the end
    ListNode<T> *previous;
    previous = head;

    ListNode<T> *temp = nodePtr;

    while(temp != NULL) {
    std::cout << temp->value << ", ";
    head->next = NULL;

    nodePtr->next = previous;
    while(temp != NULL)
    {
    temp = nodePtr->next;

    temp = temp->next;
    nodePtr->next = previous;

    previous = nodePtr;
    }

    head = temp;
    temp->next = nodePtr;



    head = nodePtr;
    }
  7. @ryanbrosnahan ryanbrosnahan created this gist Sep 10, 2012.
    26 changes: 26 additions & 0 deletions gistfile1.cpp
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,26 @@
    template <typename T>
    void LinkedList<T>::reverseList() {

    ListNode<T> *nodePtr; //to traverse the front
    nodePtr = head->next;

    ListNode<T> *previous; //to traverse the end
    previous = head;

    ListNode<T> *temp = nodePtr;

    while(temp != NULL) {
    std::cout << temp->value << ", ";

    nodePtr->next = previous;

    temp = temp->next;

    }

    head = temp;
    temp->next = nodePtr;



    }