LeetCode206反转链表

206. 反转链表

反转一个单链表。

示例:

输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
进阶:
你可以迭代或递归地反转链表。你能否用两种方法解决这道题？

solution 1:循环迭代

class Solution {
    public ListNode reverseList(ListNode head) {
        //循环迭代, 三指针
        ListNode prev = null;
        ListNode curr = head;
        while (curr != null) {
            ListNode next = curr.next;
            curr.next = prev;
            prev = curr;
            curr = next;
        }
        return prev;
    }
}

class Solution {
    public ListNode reverseList(ListNode head) {
        //循环迭代,三指针，head代替一指针
        ListNode pre = null;
        while (head != null) {
            ListNode next = head.next;
            head.next = pre;
            pre = head;
            head = next;
        }
        return pre;

    }
}

solution 2:递归

class Solution {
    public ListNode reverseList(ListNode head) {
        //递归
        if (head == null || head.next == null) return head;
        ListNode p = reverseList(head.next);
        head.next.next = head;
        head.next = null;
        return p;
    }
}

LeetCode206反转链表

原文：https://www.cnblogs.com/gg12138/p/12906781.html