Java实现合并俩个有序单链表,合并后的链表仍然有序

package com.yyh;

/**
 * @author yyh
 * @create 2021-04-11 17:38
 */
public class SLinkList {
    public static void main(String[] args) {
        SingleLinkedList s1 = new SingleLinkedList();
        SingleLinkedList s2 = new SingleLinkedList();
        HeroNode node1 = new HeroNode(1, "lixing1");
        HeroNode node2 = new HeroNode(2, "lixing2");
        HeroNode node3 = new HeroNode(3, "lixing3");
        s1.add(node1);
        s1.add(node3);
        s1.add(node2);
        System.out.println("s1:");
        s1.list(s1.getHead());
        HeroNode node4 = new HeroNode(4, "lixing4");
        HeroNode node5 = new HeroNode(5, "lixing5");
        s2.add(node4);
        s2.add(node5);
        System.out.println("s2:");
        s2.list(s2.getHead());
        System.out.println("合并后");
        hebing(s1, s2);
        /*HeroNode node=addall(s1,s2);
        s2.list(node);
*/
    }

    public static void hebing(SingleLinkedList s1, SingleLinkedList s2) {

        HeroNode temp = s1.getHead().next;
        HeroNode next = null;
        HeroNode temp2 = s2.getHead();
        while (temp!= null) {
           next=temp.next;      //记录s1 temp下一个元素
           s2.add(temp);          //将temp取下 放入s2
           temp=next;                 //temp后移
        }
        s2.list(temp2);

    }
}


class SingleLinkedList {
    private HeroNode head = new HeroNode(0, "");

    public HeroNode getHead() {
        return head;
    }

    public void list(HeroNode head) {
        if (head == null) {
            System.out.println("链表为空");
            return;
        }
        HeroNode temp = head.next;
        while (temp != null) {
            System.out.println(temp);
            temp = temp.next;
        }
    }

    public void add(HeroNode node) { //有序插入

        HeroNode temp = head;
        while (true) {
            if (temp.next == null) { //说明已经到了最后
            
                break;
            } else if (temp.next.no >= node.no) {
                break;
            }
            temp = temp.next;
        }
        node.next = temp.next;
        temp.next = node;
    }
}

class HeroNode{
    public  int no;
    public String name;
    public HeroNode next;

    public HeroNode(int no, String name) {
        this.no = no;
        this.name = name;
    }

    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                '}';
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值