双向链表实现

通过 pre 和 next 字段实现双向链表

class TwoLinkedList{

private final DoubleNode head = new DoubleNode(0,"","");

public void add(DoubleNode doubleNode){
    DoubleNode temp = head;
    while (temp.getNext() != null){
        temp = temp.getNext();
    }
    temp.setNext(doubleNode);
    doubleNode.setPre(temp);
}

public void addByOrder(DoubleNode doubleNode){
    DoubleNode temp = head.getNext();
    while(true){
        if (temp.getNext() == null){
            temp.setNext(doubleNode);
            doubleNode.setPre(temp);
            break;
        }
        if (temp.getNo() == doubleNode.getNo()){
            return;
        }
        if (temp.getNo() > doubleNode.getNo()){
            temp.getPre().setNext(doubleNode);
            doubleNode.setNext(temp);
            break;
        }
        temp = temp.getNext();
    }
}

public void delete(int no){
    if (head.getNext() == null){
        return;
    }
    DoubleNode temp = head.getNext();
    while(temp != null){
        if (temp.getNo() == no){
            temp.getPre().setNext(temp.getNext());
            if (temp.getNext() != null) temp.getNext().setPre(temp.getPre());
            break;
        }
        temp = temp.getNext();
    }
}

}

class DoubleNode {

private int no;

private String name;

private String nickName;

private DoubleNode pre;

private DoubleNode next;

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

public int getNo() {
    return no;
}

public void setNo(int no) {
    this.no = no;
}

public String getName() {
    return name;
}

public void setName(String name) {
    this.name = name;
}

public String getNickName() {
    return nickName;
}

public void setNickName(String nickName) {
    this.nickName = nickName;
}

public DoubleNode getPre() {
    return pre;
}

public void setPre(DoubleNode pre) {
    this.pre = pre;
}

public DoubleNode getNext() {
    return next;
}

public void setNext(DoubleNode next) {
    this.next = next;
}

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

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值