LeetCode-反转链表-简单

标题：206反转链表-简单

题目

给你单链表的头节点 head ，请你反转链表，并返回反转后的链表。

示例1

输入：head = [1,2,3,4,5]
输出：[5,4,3,2,1]

示例2

输入：head = [1,2]
输出：[2,1]

示例3

输入：head = []
输出：[]

提示

• 链表中节点的数目范围是 [0, 5000]
• -5000 <= Node.val <= 5000

进阶

**进阶：**链表可以选用迭代或递归方式完成反转。你能否用两种方法解决这道题？

代码Java

public class ReverseList {
    // 循环实现
    public ListNode reverseList(ListNode head) {
        if (head == null)
            return null;
        if (head.next == null)
            return head;
        ListNode p = head.next;
        ListNode s = head;
        while (p != null) {
            s.next = p.next;
            p.next = head;
            head = p;
            p = s.next;
        }
        return head;
    }
    // 递归实现
    public ListNode reverseList1(ListNode head) {
        if (head == null)
            return null;
        if (head.next == null)
            return head;
        ListNode p = head.next;
        head.next = null;
        head = reverse(head, p);
        return head;
    }
    public ListNode reverse(ListNode head, ListNode node) {
        if (node == null)
            return head;
        ListNode p = node.next;
        node.next = head;
        head = node;
        return reverse(head, p);
    }
}