单列表反转
递归调用reverse函数,直到当前结点没有下一个结点
public void reverse(){
if(isEmpty()){
return;
}
reverse(head.next);
}
public void reverse(Node curr){
if(curr.next == null){
head.next = curr;
return curr;
}
Node pre = reverse(curr.next);
pre.next =curr ;
curr.next = null;
return curr;
}