本文共 516 字，大约阅读时间需要 1 分钟。

//一个是递归，一个是头插法//递归public ListNode ReverseList(ListNode head) {    if (head == null || head.next == null)        return head;    ListNode next = head.next;    head.next = null;    ListNode newHead = ReverseList(next);    next.next = head;    return newHead;}//迭代public ListNode ReverseList(ListNode head) {    ListNode newList = new ListNode(-1);    while (head != null) {        ListNode next = head.next;        head.next = newList.next;        newList.next = head;        head = next;    }    return newList.next;}

转载地址：http://adkmi.baihongyu.com/