双向链表的实现以及增删改查

怼烎@ 2022-09-07 12:14 211阅读 0赞

package com.example.datastructrue.linkedlist;
    
    import javax.swing.plaf.synth.SynthLabelUI;
    
    public class DoubleLinkedListDemo {
        
        public static void main(String[] args) {
        
    
            DoubleLinkedList list = new DoubleLinkedList();
            DoubleHeroNode node1 = new DoubleHeroNode(1,"花容月貌1","花花1");
            DoubleHeroNode node2 = new DoubleHeroNode(2,"花容月貌2","花花2");
            DoubleHeroNode node3 = new DoubleHeroNode(3,"花容月貌3","花花3");
            DoubleHeroNode node4 = new DoubleHeroNode(4,"花容月貌4","花花4");
    
    //        System.out.println("无序添加");
    //       list.add(node1);
    //       list.add(node2);
    //       list.add(node3);
    //       list.add(node4);
    //        list.list();
    //        System.out.println("修改后");
    //        DoubleHeroNode node5 = new DoubleHeroNode(4,"花容月貌44","花花44");
    //        list.update(node5);
    //        list.list();
            System.out.println("有序添加");
            list.addOrderByNo(node1);
            list.addOrderByNo(node3);
            list.addOrderByNo(node2);
            list.addOrderByNo(node4);
            list.list();
    
            System.out.println("删除后");
            list.del(2);
            list.list();
    
        }
    }
    
    //双向链表的实现类
    class DoubleLinkedList{
        
        private DoubleHeroNode doubleHead = new DoubleHeroNode(0,"","");
    
        public DoubleHeroNode getDoubleHead() {
        
            return doubleHead;
        }
    
    //    遍历双向链表
        public void list(){
        
            if (doubleHead.next==null){
        
                System.out.println("该双向链表为空");
                return;
            }
            DoubleHeroNode temp = doubleHead;
            while (true){
        
                if(temp.next==null){
        
                    break;
                }
                temp = temp.next;
                System.out.println("双向链表："+temp.toString());
            }
        }
    
        //    添加节点
        public void add(DoubleHeroNode node){
        
            DoubleHeroNode temp = doubleHead;
    
            while (true){
        
                if(temp.next==null){
        
                    break;
                }
                temp = temp.next;
            }
                node.pre = temp;
                temp.next = node;
    
        }
    
    //    有序的添加节点
        public void addOrderByNo(DoubleHeroNode node){
        
            DoubleHeroNode temp = doubleHead;
            boolean flag = false;
            while (true){
        
                if (temp.next==null){
        
                    break;
                }else if(temp.next.no>node.no){
        
                    break;
                }else if(temp.next.no==node.no){
        
                    flag = true;
                    break;
                }
                temp = temp.next;
            }
            node.pre = temp;
           if (temp.next!=null){
        
               node.next = temp.next;
           }
            temp.next = node;
        }
    
    //    修改节点
        public void update(DoubleHeroNode node){
        
            if (doubleHead.next==null){
        
                System.out.println("该双向链表为空");
                return;
            }
            DoubleHeroNode temp = doubleHead;
            boolean flag = false;
            while (true){
        
                if (temp==null){
        
                    break;
                }else if(temp.no==node.no){
        
                    flag = true;
                    break;
                }
                temp = temp.next;
            }
            if(flag){
        
                temp.name = node.name;
                temp.nickname = node.nickname;
            }else {
        
                System.out.println("该节点不存在该链表");
            }
        }
    
    //    删除节点
        public void del(int no){
        
            if (doubleHead.next==null){
        
                System.out.println("该双向链表为空");
                return;
            }
            DoubleHeroNode temp = doubleHead.next;
            boolean flag = false;
            while (true){
        
                if (temp==null){
        
                    break;
                }else if(temp.no==no){
        
                    flag = true;
                    break;
                }
                temp = temp.next;
            }
            if (flag){
        
                temp.pre.next = temp.next;
                if (temp.next!=null){
        
                    temp.next.pre = temp.pre;
                }
            }else {
        
                System.out.println("该双向链表不存在该节点");
            }
    
        }
    }
    
    //双向链表节点类
    class DoubleHeroNode{
        
        //    编号
        public int no;
        //    姓名
        public String name;
        //    昵称
        public String nickname;
        //    下一个节点
        public DoubleHeroNode next;
    //    上一个节点
        public DoubleHeroNode pre;
    
        public DoubleHeroNode(int no,String name,String nickname){
        
            this.no = no;
            this.name = name;
            this.nickname = nickname;
        }
    
        @Override
        public String toString() {
        
            return "HeroNode{" +
                    "no=" + no +
                    ", name='" + name + '\'' +
                    ", nickname='" + nickname + '\'' +
                    '}';
        }
    
    }