java - reversing a linked list with the head node -

java - reversing a linked list with the head node -

well seems i'm running infinite loop trying reverse list. have random numbers 4,5,6,7 , trying reverse 7,6,5,4. started node @ the head , added end lastly node until final list(ie 7,4 ->7,5,4,) every i've attempted giving me infinite loops.

public void reversing() { node<e> = this.head;//set head loo[ node<e> lastly = this.head; node<e> temp = this.head; //not used anymore last=lastnode();//gets lastly item in list while (currently != null) {//loop until not null last.next=currently; currently=currently.next; if(last.info==currently.info){//break out of loop break; } } }

you reversing singly linked list. see question shows how reverse singly linked list java

i'll re-create in answer:

node<e> reversedpart = null; node<e> current = head; while (current != null) { node<e> next = current.next; current.next = reversedpart; reversedpart = current; current = next; } head = reversedpart;

java linked-list nodes