单链表逆置(递归和迭代)

迭代

class Solution {
  public ListNode reverseList(ListNode head) {
    if (head == null) return head;
    ListNode a=head, b=head.next;
    head.next = null;
    while (b != null) {
      ListNode c = b.next;
      b.next = a;
      a = b;
      b = c;
    }
    return a;
  }
}

递归

class Solution {
  public ListNode reverseList(ListNode head) {
    if (head==null || head.next==null) {
      return head;
    }
    ListNode res = reverseList(head.next);
    head.next.next = head;
    head.next = null;
    return res;
  }
}