剑指offer:链表反转

问题描述：定义一个函数，输入一个链表的头节点，反转该链表并输出反转后链表的头节点。

示例：

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

限制：

0 <= 节点个数 <= 5000

这里有两种方式可以解决：

1. 迭代的方式：

package com.involution.algorithm.reverse;

public class ReverseList {


    static class ListNode {

        int val;

        ListNode next;

        public ListNode(int val, ListNode next) {

            this.val = val;
            this.next = next;
        }
    }

    public static ListNode iterate(ListNode head) {

        ListNode prev = null, next;
        ListNode curr = head;

        while (curr != null) {

            next = curr.next;
            curr.next = prev;
            prev = curr;
            curr = next;
        }

        return prev;
    }

    public static void main(String[] args) {

        // 通过迭代的方式
        ListNode node5 = new ListNode(5, null);
        ListNode node4 = new ListNode(4, node5);
        ListNode node3 = new ListNode(3, node4);
        ListNode node2 = new ListNode(2, node3);
        ListNode node1 = new ListNode(1, node2);

        ListNode prev = iterate(node1);
        System.out.println(prev.val);
    }

}

2. 递归的方式：

package com.involution.algorithm.reverse;

public class ReverseListV2 {

    static class ListNode {

        int val;

        ListNode next;

        public ListNode(int val, ListNode next) {

            this.val = val;
            this.next = next;
        }


    }

    public static ListNode recursion(ListNode head) {

        if (head == null || head.next == null) {
            return head;
        }

        ListNode newHead = recursion(head.next);

        head.next.next = head;
        head.next = null;
        return newHead;
    }


    public static void main(String[] args) {

        // 通过递归的方式
        ListNode node5 = new ListNode(5, null);
        ListNode node4 = new ListNode(4, node5);
        ListNode node3 = new ListNode(3, node4);
        ListNode node2 = new ListNode(2, node3);
        ListNode node1 = new ListNode(1, node2);


        ListNode listNode = recursion(node1);

        System.out.println(listNode.val);

    }


}