Java数组和链表模拟队列_java 链表模拟队列-优快云博客

本文链接：https://blog.youkuaiyun.com/l_vaule/article/details/79438755

本文介绍了两种队列数据结构的实现方法：链式队列(LinkQueue)和数组队列(ArrayQueue)。链式队列使用节点进行数据存储，并提供了添加(addNode)、弹出(popNode)等基本操作；数组队列采用动态数组实现，支持添加节点到队尾及从队首移除节点等功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

package com.example.datastruct;

import java.util.Arrays;

public class LinkQueue<T> {
	Node<T> head;
	Node<T> tail;
	int mSize;
	
	public boolean addNode(Node<T> node){
		if (node == null) {
			return false;
		}
		if (head == null){
			head = node;
			tail = head;
		}else {
			tail.next = node;
			tail = tail.next;
		}
		mSize++;
		return true;
	}
	public Node popNode() throws Exception{
		if(mSize == 0){
			throw new Exception();
		}	
		Node currentNode = head;
		head = head.next;
		mSize--;
		return currentNode;
	}
	
	
	public int getSize(){
		return mSize;
	}
	public boolean isEmpty(){
		return mSize == 0 ? true:false;
	}
	
}
class ArrayQueue<T>{
	  int mHead;
	  int mSize;
	  int max;
	  T data[];
	  public ArrayQueue(int max) {
		  data = (T[]) new Object[max];
		  this.max = max;
	  }
	  public int getSize(){
			return mSize;
	  }
	  public boolean isEmpty(){
			return mSize == 0 ? true:false;
	  }
	  public boolean addNode(Node<T> node){
			if (node == null) {
				return false;
			}
			if(mSize == max){
				data = Arrays.copyOf(data, max * 2);
				max *= 2;
			}
			data[mSize++] = (T) node;
			mSize++;
			return true;
		}
		public Node popNode() throws Exception{
			if(mSize == 0){
				throw new Exception();
			}	
			Node currentNode = (Node) data[mHead];
			mHead++;
			return currentNode;
		}
		
}
class Node<T>{
	int data;
	Node<T> next;
	public Node(int data) {
		super();
		this.data = data;
	}
	public Node() {
		// TODO Auto-generated constructor stub
	}
}