使用递归反转单链表

class Node {  
    char value;  
    Node next;  
}  

public Node reverse(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;  
 }