Algorithm-----Reverse order of single-linked list

First, all reverse order

　　

Define two variables pre, next, along with node head, to traverse the entire list.

while (head! = null) {  next = Head.next;  Head.next = pre;  Pre = head;  Head = Next;  }

Second, partial reverse order

First, the previous node and the latter node of the node area that need to be reversed are found. Remember as Pre,pos.

Define 3 variables cur, next1, next2. Traverse the linked list.

Node cur = pre.next; Node next1 = Cur.next;cur.next = pos; Node next2 = Null;while (next1! = pos) {   next2 = Next1.next;   Next1.next = cur;   cur = next1;   Next1 = next2;}

　　

Algorithm-----Reverse order of single-linked list