剑指offer-问题16

最新推荐文章于 2021-08-29 19:49:26 发布

转载最新推荐文章于 2021-08-29 19:49:26 发布 · 167 阅读

算法专栏收录该内容

54 篇文章

订阅专栏

本文提供了两种链表逆序的方法，包括迭代和递归方式，通过具体的Java代码实现了链表的逆序，并展示了逆序前后链表的打印结果。

package offer;

/**
 * offer interview 16
 */
public class Test16 {

    public static class ListNode{
        int value;
        ListNode next;

        public ListNode(){
        }

        public ListNode(int value){
            this.value = value;
            this.next = null;
        }

    }


    //method 1
    public static ListNode reverseList(ListNode head){
        ListNode root = new ListNode();
        root.next = null;

        ListNode next;

        while (head != null){
            next = head.next;

            head.next = root.next;
            root.next = head;

            head = next;
        }

        return root.next;

    }

    //method 2
    public static ListNode reverseList2(ListNode head){
        ListNode reverseHead = null;
        ListNode curr = head;
        ListNode prev = null;
        ListNode next;

        while (curr != null){
            reverseHead = curr;
            next = curr.next;

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

        return reverseHead;
    }


    public static void printList(ListNode head){
        while (head != null){
            System.out.print(head.value + "->");
            head =  head.next;
        }
        System.out.println("null");
    }

    public static void main(String[] args){
        ListNode head = new ListNode(1);
        head.next = new ListNode(2);
        head.next.next = new ListNode(3);
        head.next.next.next = new ListNode(4);
        head.next.next.next.next = new ListNode(5);
        head.next.next.next.next.next = new ListNode(6);
        head.next.next.next.next.next.next = new ListNode(7);
        head.next.next.next.next.next.next.next = new ListNode(8);
        head.next.next.next.next.next.next.next.next = new ListNode(9);

        printList(head);
        head = reverseList(head);
        printList(head);

        System.out.println("========");
        head = reverseList2(head);
        printList(head);
    }

}