数据结构 双向链表的相关操作

class BookNode

public class BookNode {
    public int id;
    public String name;
    public double price;
    //节点下一个节点 直接后继
    public BookNode next;
    //上一个节点 直接前驱
    public BookNode pre;

    public BookNode(int id, String name, double price) {
        this.id = id;
        this.name = name;
        this.price = price;
    }

    @Override
    public String toString() {
        return "BookNode{" +
                "id=" + id +
                ", name='" + name + '\'' +
                ", price=" + price +
                '}';
    }
}

class DualLinkedList

public class DualLinkedList {
    private BookNode head = new BookNode(0,"",0.0);
    /**
     * 往双向链表的末尾添加节点
     */
    public void addLast(BookNode newNode){
        BookNode temp= head;
        while(true){
            if(temp.next==null){
                break;
            }
            temp=temp.next;
        }
        temp.next=newNode;
        newNode.pre=temp;
    }
    /**
     * 修改双向链表中的结点
     * 条件：双向链表中的每一个结点的id和修改的id对比，如果对比成功，则进行修改该节点
     * 如果没有对比成功，说明双向链表中没有该节点
     */
    public void updateNode(BookNode newNode){
//        是否是空链表
        if(head.next==null){
            throw new RuntimeException("此双向链表为空链表");
        }
        BookNode temp=head.next;
        boolean flg=false;
        while(true){
            if(temp==null){
                break;
                //找到链表的末尾我们都没有找到
            }
            if(temp.id== newNode.id){
                flg=true;
                break;
            }
            temp=temp.next;
        }
        if(flg){
            temp.name= newNode.name;
            temp.price= newNode.price;
        }else {
            throw new RuntimeException("此链表中不存在要修改的结点");
        }
    }
    /**
     * 双向链表的删除
     * 条件：根据id编号进行删除结点
     */
    public void delNode(int id){
        if(head.next==null){
            throw new RuntimeException("此链表为空链表");
        }
        BookNode temp=head;
        boolean flg=false;
        while (true){
            if(temp.next==null){
                break;
            }
            if(temp.next.id==id){
                flg=true;
                break;
            }
            temp=temp.next;
        }
        if(flg){
            temp.next=temp.next.next;
            if(temp.next!=null){
                temp.next.pre=temp;
            }
        }else {
            throw new RuntimeException("此链表中不存在要被删除的结点");
        }
    }
    /**
     * 输出双向链表中的所有结点
     */
    public void list(){
        if(head.next==null){
            throw new RuntimeException("此双向链表为空链表");
        }
        BookNode temp=head.next;
        while (true){
            if(temp==null){
                break;
            }
            System.out.println(temp);
            temp=temp.next;
        }
    }
    /**
     * 按照id从小到大的顺序往双向链表中添加节点
     */
    public void orderLinkedList(BookNode bookNode){
        BookNode temp=head;
        if(temp.next==null){
            temp.next=bookNode;
            return;
        }
        boolean flg=false;
        while (true){
            if(temp.next==null){
                break;
            }
            if(temp.next.id>bookNode.id){
                flg=true;
                break;
            }else {//如果要添加的节点的id在双向链表中已经存在的话
                //就更新已经存在的节点
                if(temp.next.id== bookNode.id){
                    temp.next.name= bookNode.name;
                    temp.next.price= bookNode.price;
                    return;
                }
            }
            temp=temp.next;
        }
        if(flg==true){
            temp.next.pre=bookNode;
            bookNode.next=temp.next;
            temp.next=bookNode;
            bookNode.pre=temp.next;
        }else {
            temp.next=bookNode;
            bookNode.pre=temp;
        }
    }
}

class DualLinkedListTest

public class DualLinkedListTest {
    public static void main(String[] args) {
        DualLinkedList dualLinkedList= new DualLinkedList();
        BookNode bookNode1 =new BookNode(1,"百年孤独",199);
        BookNode bookNode2 =new BookNode(2,"百年孤独",299);
        BookNode bookNode3 =new BookNode(3,"百年孤独",399);
        BookNode bookNode4 =new BookNode(4,"百年孤独",499);
//        BookNode bookNode5 =new BookNode(5,"百年孤独",599);
/*        dualLinkedList.addLast(bookNode1);
        dualLinkedList.addLast(bookNode2);
        dualLinkedList.addLast(bookNode3);
        dualLinkedList.addLast(bookNode4);*/
//        dualLinkedList.addLast(bookNode5);
//        dualLinkedList.delNode(2);
//        dualLinkedList.updateNode(new BookNode(3,"老人与海",599));
        dualLinkedList.orderLinkedList(bookNode4);
        dualLinkedList.orderLinkedList(bookNode3);
        dualLinkedList.orderLinkedList(bookNode2);
        dualLinkedList.orderLinkedList(bookNode1);
        dualLinkedList.orderLinkedList(new BookNode(3,"java编程思想",199));
        dualLinkedList.list();
    }
}