1、非递归
public Node reverse(Node current){
Node previousNode =null;
Node nextNode=null;
while(current!=null){
nextNode=current.next;
current.next=previousNode;
previousNode=current;
current=nextNode;
}
return previousNode;
}
2、递归
public Node reverse1(Node current){
if(current==null||current.next==null)
return current;
Node nextNode=current.next;
current.next=null;
Node reverseRest=reverse(nextNode);
nextNode.next=current;
return reverseRest;
}