Java用链式存储结构实现队列

红太狼 2023-07-10 11:10 29阅读 0赞

[*点击进入尚硅谷数据结构和算法Java代码导航*][Java]

//用尾插法实现队列
    public class LinkQuene {
        
    	//
    	private class Node{
        
    		String data;
    		Node next;
    		public Node(String s) {
        
    			this.data = s;
    			this.next = null;
    		}
    	}
    	private Node head;
    	private Node rear;
    	public LinkQuene() {
        
    		this.head = new Node(null);
    		this.rear = head;
    	}
    	//入队，尾插法添加元素
    	public void in(String s) {
        
    		Node temp = new Node(s);
    		rear.next = temp;
    		rear = temp;
    	}
    	//，出队，获取并删除首元素
    	public String out() {
        
    		Node temp = head.next;
    		String t = temp.data;
    		head.next = temp.next;
    		if(head.next == null) {
        
    			rear = head;
    		}
    		return t;
    	}
    	//返回首元素值
    	public String get() {
        
    		if(head.next == null) {
        
    			throw new RuntimeException("Empty queue!");
    		}
    		return head.next.data;
    	}
    	//输出队列
    	public void print() {
        
    		Node temp = head.next;
    		while(temp != null) {
        
    			System.out.print(temp.data + " ");
    			temp = temp.next;
    		}
    	}
    	//清空队列
    	public void empty() {
        
    		this.head = new Node(null);
    		this.rear = head;
    	}
    	public static void main(String[] args) {
        
    		// TODO Auto-generated method stub
    
    		LinkQuene lq = new LinkQuene();
    		lq.in("a");
    		lq.in("b");
    		lq.in("c");
    		lq.empty();
    		lq.in("d");
    		lq.in("e");
    		lq.out();
    		lq.print();
    	}
    }

[Java]: https://blog.csdn.net/weixin_44963741/article/details/105228982