公式测试

public void reverse(head){
    ListNode current, prev, next;
    current = head;
    prev = null;
    while(current!=null){
        next = current.next;
        current.next = prev;
        prev = current;
        current = next;
    }
    head = prev;
    return head;
}