java双链表节点类声明,java 实现双端链表(同时包含头节点和尾节点的引用)

package helloclean.mylink;

public class Link {

public String dataStr;

public Link next;

public Link(String dataStr) {

this.dataStr = dataStr;

this.next = null;

}

public void disPlay() {

System.out.print(" {" + dataStr + "} ");

}

}

package helloclean.mylink;

/**

* 双端链表, 同时维护 first 和 last

*/

public class FirstLastLink {

private Link first;

private Link last;

public FirstLastLink() {

this.first = null;

this.last = null;

}

public boolean isEmpty() {

return (first == null);

}

public void insertFist(String key) {

Link newNode = new Link(key);

if(isEmpty()) {

this.last = newNode;

}

newNode.next = first;

first = newNode;

}

public void inserLast(String key) {

Link newNode = new Link(key);

if(isEmpty()) {

first = newNode;

} else {

last.next = newNode;

}

last = newNode;

}

public String deleteFirst() {

String temp = first.dataStr;

if(first.next == null) {

last = null;

}

first = first.next;

return temp;

}

public void disPlay() {

System.out.println("first -> last : ");

Link current = first;

while (current != null) {

current.disPlay();

current = current.next;

}

System.out.println();

}

}

package helloclean.mylink;

public class FirstLastApp {

public static void main(String[] args) {

FirstLastLink firstLastLink = new FirstLastLink();

firstLastLink.insertFist("1");

firstLastLink.insertFist("2");

firstLastLink.insertFist("3");

firstLastLink.disPlay();

firstLastLink.inserLast("4");

firstLastLink.inserLast("5");

firstLastLink.inserLast("6");

firstLastLink.disPlay();

firstLastLink.deleteFirst();

firstLastLink.deleteFirst();

firstLastLink.disPlay();

}

}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值