反转单链表

一、反转单链表

//反转单链表链表
class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}
public class Solution {
    public ListNode ReverseList(ListNode head) {
       ListNode Rehead=null;
       while(head!=null)
       {
           ListNode tmp=head;
           head=head.next;
           tmp.next=Rehead;
           Rehead=tmp;
           //System.out.println(Rehead.val);

       }

       return Rehead;
    }

    //打印单链表
    public void PrintList(ListNode head){
        while(head!=null)
        {
             System.out.print(head.val+" ");
             head=head.next;
        }
        System.out.println();
    } 

    public static void main(String[]args){
         //System.out.println("Hello");
        ListNode head=new ListNode(1);
         head.next=new ListNode(2);
         head.next.next=new ListNode(3);
         Solution s=new Solution();
         s.PrintList(head);
         s.PrintList(s.ReverseList(head));

    }
}