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

class Node {

    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