单链表的逆转

package DataStructureTest_Reverse;import DataStructureTestSinglyLinkedList.Node;import DataStructureTestSinglyLinkedList.SinglyLinkedList;public class SinglyLinkedList_reverse {public static<T> void reverse(SinglyLinkedList<T> list){Node<T> p = list.head.next;Node<T> front=null,succ=null;while(p!=null){succ=p.next;p.next=front;front=p;p=succ;}list.head.next=front;}public static void main(String[] args){String[] element={"A","B","C","D","E"};SinglyLinkedList<String> list = new SinglyLinkedList<String>(element);System.out.print(list.toString());reverse(list);System.out.print(list.toString());}}

; ;