leetcode-206. 反转链表

leetcode-206 反转链表

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/reverse-linked-list
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
反转一个单链表。

示例:

输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL

进阶:
你可以迭代或递归地反转链表。你能否用两种方法解决这道题？

迭代法:

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode pre = null;
        ListNode curr = head;
        ListNode next = null;
        // 翻转链表长度在增大，原链表长度在减小
        while (curr != null) {
            next = curr.next;
			
            curr.next = pre;
            pre = curr;
            curr = next;
        }
        return pre;
    }
}

递归法：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
        // 头结点为空或者链表长度为1，不必翻转
        if (head == null || head.next == null) {
            return head;
        }
        // head结点后全部翻转
        ListNode newNode = reverseList(head.next);
        // 将head变为翻转链表的尾结点
        head.next.next = head;
        head.next = null;
        return newNode;
    }
}