java 实现数组队列和链表队列

package Queue;
//用数组实现自己的队列
public class Queue {
	private static int DEFAULT_SIZE=100;
	private Object[] queue;
	private int front;
	private int tail;
	private int thelength;
	public Queue(){
		thelength=DEFAULT_SIZE;
		init();
	}
	public Queue(int length){
		thelength=length;
		init();
	}
	
	public int size(){
		return (front-tail+queue.length)%queue.length;
	}
	private void init() {
		queue=new Object[thelength+1];
		tail=front=0;
	}
	
	//入队列
	public void put(Object e) throws Exception{
		if(isFull()){
			throw new Exception("队列已经满了,添加失败!");
		}
		queue[front]=e;
		front=(front+1)%queue.length;	
	}
	
	//出队列
	public Object get() throws Exception{
		if(isEmpty()){
			throw new Exception("队列为空,删除失败!");
		}
		Object e=queue[tail];
		queue[tail]=null;
		tail=(tail+1)%queue.length;
		return e;
	}
	
	//清空队列
	public void clear(){
		queue=null;
		queue=new Object[thelength];
	}
	
	public boolean isEmpty() {
		return front==tail;
	}
	//判断队列是否已满
	public boolean isFull() {
		return (front+1)%queue.length==tail;
	}
	
	public static void main(String[] args){
		Queue que=new Queue(4);
		char[] data=new char[]{'沧', '海','一','声'};
		try {
		for(int i=0;i
  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Java实现栈的代码: ```java public class Stack { private int maxSize; private int[] stackArray; private int top; public Stack(int size) { maxSize = size; stackArray = new int[maxSize]; top = -1; } public void push(int value) { if (isFull()) { System.out.println("Stack is full!"); return; } stackArray[++top] = value; } public int pop() { if (isEmpty()) { System.out.println("Stack is empty!"); return -1; } return stackArray[top--]; } public int peek() { if (isEmpty()) { System.out.println("Stack is empty!"); return -1; } return stackArray[top]; } public boolean isEmpty() { return (top == -1); } public boolean isFull() { return (top == maxSize - 1); } } ``` Java实现队列的代码: ```java public class Queue { private int maxSize; private int[] queueArray; private int front; private int rear; private int nItems; public Queue(int size) { maxSize = size; queueArray = new int[maxSize]; front = 0; rear = -1; nItems = 0; } public void insert(int value) { if (isFull()) { System.out.println("Queue is full!"); return; } if (rear == maxSize - 1) { rear = -1; } queueArray[++rear] = value; nItems++; } public int remove() { if (isEmpty()) { System.out.println("Queue is empty!"); return -1; } int temp = queueArray[front++]; if (front == maxSize) { front = 0; } nItems--; return temp; } public int peekFront() { if (isEmpty()) { System.out.println("Queue is empty!"); return -1; } return queueArray[front]; } public boolean isEmpty() { return (nItems == 0); } public boolean isFull() { return (nItems == maxSize); } } ``` Java实现数组的代码: ```java public class MyArray { private int[] array; private int length; public MyArray(int[] arr) { array = arr; length = arr.length; } public int get(int index) { if (index < 0 || index >= length) { System.out.println("Invalid index!"); return -1; } return array[index]; } public void set(int index, int value) { if (index < 0 || index >= length) { System.out.println("Invalid index!"); return; } array[index] = value; } public int length() { return length; } public void display() { for (int i = 0; i < length; i++) { System.out.print(array[i] + " "); } System.out.println(); } } ``` Java实现链表的代码: ```java public class Node { public int value; public Node next; public Node(int val) { value = val; next = null; } } public class LinkedList { private Node head; public LinkedList() { head = null; } public void insertFirst(int value) { Node newNode = new Node(value); newNode.next = head; head = newNode; } public Node deleteFirst() { if (isEmpty()) { System.out.println("List is empty!"); return null; } Node temp = head; head = head.next; return temp; } public boolean isEmpty() { return (head == null); } public void display() { Node current = head; while (current != null) { System.out.print(current.value + " "); current = current.next; } System.out.println(); } } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值