java不带头节点的单链表反转

class Node<T> {

    public T data;
    public Node next;

    public Node(T dataPoration){
        data=dataPoration;
    }
}


public class LinkList {

    public Node head;
    public Node current;


    //添加节点
    public  void add(int data){
        if(head==null){
            head=new Node(data);
            current=head;
        }else{
            current.next=new Node(data);
            current=current.next;
        }

    }
    //初始化链表
    public Node init(int len){
        for(int i=0;i<len;i++){
            this.add(i);
        }
        return head;
    }


    //打印链表
    public void PrintLink(){
        current=head;
        while(current!=null){
            System.out.print(current.data+" ");
            current=current.next;
        }
    }
    //链表反转
    public void reList(){

        Node q=head.next;
        head.next=null;
        Node p;
        while (q!=null) {
            p=q;
            q=q.next;
            p.next=head;
            head=p;
        }
    }
}