Java实现双向链表

package test2;

class dLinkNode{
	private long lData;
	public dLinkNode pre;
	public dLinkNode next;
	
	public dLinkNode(long lData){
		pre = null;
		next = null;
		this.lData = lData;
	}
	
	public void displayNodeData(){
		System.out.println("lData:"+this.lData);
	}
}

public class DoublyLink {
	public dLinkNode first;
	public dLinkNode last;
	
	public DoublyLink(){
		first = null;
		last = null;
	}
	public void insertFront(long lData){
		dLinkNode temp = new dLinkNode(lData);
		if(first == null){
			first = temp;
			last = temp;
			temp.next = null;
			temp.pre = null;
		}
		else{
			temp.next = first;
			first = temp;
			temp.pre = null;
			
		}
	}
	public void deleteFront(){
		if(first == null || first.next == null){
			first = null;
			last = null;
			return;
		}else{
			dLinkNode temp = first;//将被删除节点的next置空;
			first = first.next;
			first.pre = null;
			temp.next = null;
		}
		
	}
	public void displayDoublyLink(){
		dLinkNode temp = first;
		System.out.println("--------");
		while(temp != null){
			temp.displayNodeData();
			temp = temp.next;
		}
		System.out.println("--------");
	}
}
class TestDoublyLink{
	public static void main(String args[]){
		DoublyLink dlink = new DoublyLink();
		dlink.insertFront(1);
		dlink.insertFront(2);
		dlink.insertFront(3);
		dlink.insertFront(4);
		dlink.displayDoublyLink();
		
		dlink.deleteFront();
		dlink.displayDoublyLink();
		
		dlink.deleteFront();
		dlink.displayDoublyLink();
		
		dlink.deleteFront();
		dlink.displayDoublyLink();
		
		dlink.deleteFront();
		dlink.displayDoublyLink();
		
	}
}
运行结果:
--------
lData:4
lData:3
lData:2
lData:1
--------
--------
lData:3
lData:2
lData:1
--------
--------
lData:2
lData:1
--------
--------
lData:1
--------
--------
--------

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值