合并两个有序的单链表，合并之后的新链表依然有序

package com.zzb.datastructure.singlelist;

import java.io.Serializable;

/**
 * @Auther: Administrator
 * @Date: 2020/1/15 16:55
 * @Description:
 * 合并两个有序的单链表，合并之后的新链表依然有序
 */
public class MergeOrderSingleLinkedListTest {
    public static void main(String[] args) {
        Node node1 = new Node(1);
        Node node2 = new Node(2);
        Node node3 = new Node(3);

        Node node4 = new Node(4);
        Node node5 = new Node(5);
        Node node6 = new Node(6);

        node1.setNext(node2);
        node2.setNext(node3);

        node4.setNext(node5);
        node5.setNext(node6);

        Node result = merge(node1,node4);

        while(result != null) {
            System.out.print(result.getData() + "\t");
            result = result.getNext();
        }
        /*
        1	2	3	4	5	6*/
    }

    private static Node merge(Node node1, Node node2) {
        // 判断需要合并