2.20 按照左右半区的方式重新组合单链表

package chapter_2_listproblem;

public class Problem_20_RelocateLinkedList {

   public static class Node {
       public int value;
       public Node next;

       public Node(int value) {
           this.value = value;
       }
   }

   public static void relocate(Node head) {
       if (head == null || head.next == null) {
           return;
       }
       Node mid = head;
       Node right = head.next;
       while (right.next != null && right.next.next != null) {
           mid = mid.next;
           right = right.next.next;
       }
       right = mid.next;
       mid.next = null;
       mergeLR(head, right);
   }

   public static void mergeLR(Node left, Node right) {
       Node next = null;
       while (left.next != null) {
           next = right.next;
           right.next = left.next;
           left.next = right;
           left = right.next;
           right = next;
       }
       left.next = right;
   }

   public static void printLinkedList(Node head) {
       System.out.print("Linked List: ");
       while (head != null) {
           System.out.print(head.value + " ");
           head = head.next;
       }
       System.out.println();
   }

   public static void main(String[] args) {
       Node head = null;
       relocate(head);
       printLinkedList(head);

       head = new Node(1);
       relocate(head);
       printLinkedList(head);

       head = new Node(1);
       head.next = new Node(2);
       relocate(head);
       printLinkedList(head);

       head = new Node(1);
       head.next = new Node(2);
       head.next.next = new Node(3);
       relocate(head);
       printLinkedList(head);

       head = new Node(1);
       head.next = new Node(2);
       head.next.next = new Node(3);
       head.next.next.next = new Node(4);
       relocate(head);
       printLinkedList(head);

       head = new Node(1);
       head.next = new Node(2);
       head.next.next = new Node(3);
       head.next.next.next = new Node(4);
       head.next.next.next.next = new Node(5);
       relocate(head);
       printLinkedList(head);

       head = new Node(1);
       head.next = new Node(2);
       head.next.next = new Node(3);
       head.next.next.next = new Node(4);
       head.next.next.next.next = new Node(5);
       head.next.next.next.next.next = new Node(6);
       relocate(head);
       printLinkedList(head);

}

alpha_2017

发布了64 篇原创文章 · 获赞 171 · 访问量 22万+

私信关注

2.20 按照左右半区的方式重新组合单链表

猜你喜欢