三种方法实现链表反转（图示）

例子：1->2->3->4->5->null  反转之后：5->4->3->2->1->null

一：

 示例代码：

public class LinkedListPractice {

    class ListNode {
        int val;
        ListNode next;

        ListNode(int x) {
            val = x;
        }
    }

    ListNode head;
    public ListNode reverseList(ListNode head) {

        //迭代，三指针法
        ListNode dummyHead = new ListNode(-1);
        dummyHead.next = head;
        if (head == null || head.next == null) {
            return head;
        } else {
            ListNode f = dummyHead.next;
            ListNode s = f.next;
            while (s != null) {
                f.next = s.next;
                s.next = dummyHead.next;
                dummyHead.next = s;
                s = f.next;
            }
        }
        return dummyHead.next;

    }
}

---

二：

 

示例代码：

public class LinkedListPractice {

    class ListNode {
        int val;
        ListNode next;

        ListNode(int x) {
            val = x;
        }
    }

    ListNode head;

    public ListNode reverseList(ListNode head) {      
        if (head == null || head.next == null) {
            return head;
        }
        ListNode prev, cur, end;
        prev = null;
        cur = head;
        end = head.next;

        while (cur != null) {
            cur.next = prev;

            prev = cur;
            cur = end;
            if (end != null) {
                end = end.next;
            }
        }
        return prev;

    }
}

 

---

三：递归实现：

public class LinkedListPractice {

    class ListNode {
        int val;
        ListNode next;

        ListNode(int x) {
            val = x;
        }
    }

    ListNode head;  
    public ListNode reverseList(ListNode head) {

        //递归
        //1.第一个条件是判断递归开始，传入的参数的合法性。第二个是递归的终止条件
        if(head == null || head.next == null) return head;
        //2.开始进行递归
        ListNode newHead = reverseList(head.next);
        //3.尾部4-5-null中，head=4,head.next=4-5 head.next.next=4-5-null,也就是5的后继指向4
        head.next.next = head;
        //4.断开之前4-5之间的连接，将4的后继指向null
        head.next = null;
        //5.返回已经反转的链表
        return newHead;

    }
}