14.输入一个链表，反转链表，返回链表的表头

package java2019;
//输入一个链表，反转链表，返回链表的表头
public class Demo14 {
	public ListNode ReverseLinkedList(ListNode head){
		ListNode p = null;
		ListNode t = null;
		while(head!=null){ //p最终变成了head , head 变成了t ，为null 即head = null
			t=head.getNext(); //head-->next 赋给t
			head.setNext(p);  //head-->p
			
			p=head;
			head=t;
		}
		return p;
	}
public static void main(String[] args) {
	ListNode root = new ListNode(1);
	ListNode n1 = new ListNode(2);
	ListNode n2 = new ListNode(3);
	ListNode n3 = new ListNode(4);
	root.setNext(n1);
	n1.setNext(n2);
	n2.setNext(n3);
	Demo14 d14 = new Demo14();
	ListNode ResultNode = d14.ReverseLinkedList(root);
	ListNode p = ResultNode;
	while(p!=null){
		System.out.print(p.getVal()+"--");
		p=p.getNext();
		
	}
}
}